Theory Of Computer Science : Automata,Languages And Computation

( 51 customers rating )
Selling Price : ₹185.63
MRP : ₹275.00
You will save : ₹89.38 after 33% Discount

Enter your email id to read this ebook
Terms and Conditions
  • 1. Pay with PayPal and get 100% cashback up to Rs. 400 on your eligible purchases. You will need to transact for a minimum value of Rs. 100 to be eligible for the offer.
  • 2. Offer is valid only for first time users/ first ever PayPal transaction in lifetime and can be availed once per PayPal user.
  • 3. Offer is valid for transactions through your PayPal India account.
  • 4. Cashback will be credited in user’s PayPal account, within 5 days after successful transaction with PayPal.
  • 5. Offer period is valid upto 31/10/2019.
  • 6. The cashback will be in the form a discount.
  • 7. Please see the Terms and Conditions for details.

Save extra with 3 Offers

Get ₹ 50

Instant Cashback on the purchase of ₹ 400 or above
SAVE10 Already Applied


Get Flat 35% Off on your First Order

Product Specifications

Publisher PHI Learning All Computer Science books by PHI Learning
ISBN 9788120329683
Number of Pages 436
Edition Third Edition
Available in all digital devices
  • Snapshot
  • About the book
Theory Of Computer Science : Automata,Languages And Computation - Page 1 Theory Of Computer Science : Automata,Languages And Computation - Page 2 Theory Of Computer Science : Automata,Languages And Computation - Page 3 Theory Of Computer Science : Automata,Languages And Computation - Page 4 Theory Of Computer Science : Automata,Languages And Computation - Page 5

About The Book Theory Of Computer Science
Book Summary:

This Third Edition, in response to the enthusiastic reception given by academia and students to the previous edition, offers a cohesive presentation of all aspects of theoretical computer science, namely automata, formal languages, computability, and complexity. Besides, it includes coverage of mathematical preliminaries.


Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2)

A rigorous proof of Kleenes theorem (Chapter 5)

Major changes in the chapter on Turing machines (TMs) A new section on high-level description of TMs Techniques for the construction of TMs Multitape TM and nondeterministic TM

A new chapter (Chapter 10) on decidability and recursively enumerable languages

A new chapter (Chapter 12) on complexity theory and NP-complete problems

A section on quantum computation in Chapter 12.


Objective-type questions in each chapterwith answers provided at the end of the book.

Eighty-three additional solved examplesadded as Supplementary Examples in each chapter.

Detailed solutions at the end of the book to chapter-end exercises.

This book is recommended in Kaziranga University, Nagaland, Tripura University, Tripura for Diploma in CSE, Cotton College State University, Guwahati for B.Sc. (Computer Science/IT), Gauhati University, Assam, Dibrugarh University, Assam, Assam Engineering College, Jorgat Engineering College, Assam, National Institute of Technology (NIT), Meghalaya, North Eastern Hill University, Meghalaya, Adamas Institute Of Technology, West Bengal, West Bengal State Council of Technical Education, West Bengal for Diploma in IT, West Bengal University of Technology for B.Tech (CSE), Centurion University, Odisha for M.Tech (CSE), NIT Patna, ISM Dhanbad, Bihar, BIT Mesra, Bihar, BIT Patna, Bihar, BIT Sindri, Dhanbad, NIT Jamshedpur, Aryabhat Knowledge University, Patna.

The book is designed to meet the needs of the undergraduate and postgraduate students of computer science and engineering as well as those of the students offering courses in computer applications.

Table of Contents:
Preface. Notations. 1. Propositions and Predicates. 2. Mathematical Preliminaries. 3. The Theory of Automata. 4. Formal Languages. 5. Regular Sets and Regular Grammars. 6. Context-Free Languages. 7. Pushdown Automata. 8. LR(k) Grammars. 9. Turing Machines and Linear Bounded Automata. 10. Decidability and Recursively Enumerable Languages. 11. Computability. 12. Complexity. Answers to Self-Tests. Solutions (or Hints) to Chapter-end Exercises. Further Reading. Index.