My Cart 0  items |  Rs 0.00
X
Your shopping Cart is currently empty.

Theory of Computer Science: Automata, Languages and Computation

Be the first to review this product

Availability: In stock (Dispatched in 5-7 Business Days days.) See Details

Shipping Timelines

 

  • All the titles clearly mention the approximate dispatch time from our warehouse from date of your order receipt. The dispatch details are:
  • 1-3 days:
  • Books are currently in stock with us or our local distributors / vendors and will be shipped within 1-3 days .
  • 3-7 days:
  • Books are available at the publishers warehouse and will need to be ordered from there.
  • 10-14 days:
  • These books are imported into India.
  • Out of stock
  • These books are currently out of stock. We accept email ID's and will intimate you once the titles are back in stock.
  • Pre-Order
  • The stock of these titles are expected shortly (usually within 2-3 weeks).

Note:

  • Books normally get DELIVERED within 1-3 days after dispatch by our couriers within major metros in India.
  • Other locations could take longer depending on our courier coverage. Such deliveries normally get completed within 3-7 days after dispatch.
  • For other areas not covered by couriers, orders will be sent by Registered Post through the Indian Postal Service which may take 1-2 weeks or more depending on the location.

Rs 275.00

Rs 234.00

You Save: Rs 41.00 (15%)

OR

Quick Overview

ISBN: 9788120329683

Theory of Computer Science: Automata, Languages and Computation

Double click on above image to view full picture

Zoom Out
Zoom In

More Views

Book Summary of Theory of Computer Science: Automata, Languages and Computation

Computers have become an intricate part of lives now, but to become a fully qualified computer engineer, a deeper knowledge of the science and theory of computing is necessary.

Before going into the practical applications of a subject, understanding of theory is essential. Theoretical computer science is a division that delves into the principles of computing. It is an abstraction of the science of computing, a mathematical analysis of theories and practices.

Theoretical computer science is generally divided into three areas of study - automata, computability and computational complexity. The automata section is the study of mathematical models of computing machines called automata or abstract machines.

The second section, computability, focuses on the sort of problems that can be solved by computers. It examines the limitations of computers, explores the boundaries of what can be achieved by computing machines.

The third part, computational complexity theory is concerned with classifying computational problems according their levels of complexity.

Theory Of Computer Science is the third edition of a popular textbook on theoretical computer science. There are many enhancements in this new edition. It covers the principle of induction and the pigeonhole principles in more depth, and also includes a rigorous proof of Kleene's theorem. 

It has an expanded section on Turing Machines. This includes coverage of TM construction and multitape and non-deterministic Turing Machines.

It includes new chapters on decidability, complexity theory, recursively enumerable languages, and NP- complete problems. There is an entire new section on quantum computing too.

Theory Of Computer Science consists of many examples and exercises, and there are numerous objective questions at the end of each chapter. Solutions for the chapter-end exercises are provided at the end of the book. It is specifically aimed at engineering students who are pursuing their undergraduate or postgraduate courses in computer science and engineering.

Details Of Book : Theory of Computer Science: Automata, Languages and Computation

Author: K. L. P. Mishra
Publisher: Phi Learning
Price: 275.0000
Our Price: 234.0000
You Save: Rs. 41(15%)
Stock: Available
Delivered In: 5-7 Business Days
Language: Paperback, English