Theory of Computer Science: Automata, Languages and Computation

Front Cover
PHI Learning Pvt. Ltd., Jan 1, 2006 - Computers - 436 pages
2 Reviews
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. NEW TO THIS EDITION • Expanded sections on pigeonhole principle and the principle of induction (both in Chapter 2) • A rigorous proof of Kleene’s 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. • KEY FEATURES • Objective-type questions in each chapter—with answers provided at the end of the book. • Eighty-three additional solved examples—added as Supplementary Examples in each chapter. • Detailed solutions at the end of the book to chapter-end exercises. 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.
 

What people are saying - Write a review

User Review - Flag as inappropriate

flat

User Review - Flag as inappropriate

book is very good for gaining concept... written in easy language... nhave nice examples... bt m in need of solutions for d book... can any one give any link to get d solutions to d excercises???

Contents

Mishra01
1
Mishra03
71
Mishra04
107
Mishra05
136
Mishra06
180
Mishra07
227
Mishra08
267
Mishra09
277
Mishra10
309
Mishra11
322
Mishra12
346
MishraAnswers
373
MishraSolution
375
MishraFurther Reading
417
MisraIndex
419
Copyright

Other editions - View all

Common terms and phrases

About the author (2006)

K.L.P. MISHRA (Ph.D., Leningrad), had a distinguished career as Professor of Electrical and Electronics Engineering, and Principal, Regional Engineering College, Tiruchirapalli. N. Chandrasekaran, Ph.D., has been Professor of Mathematics at St. Joseph’s College, Tiruchirappalli. Prof. Chandrasekaran has many years of experience in teaching mathematics at the undergraduate and postgraduate levels in reputed institutions. He is the co-author of Theory of Computer Science: Automata, Languages and Computation, published by PHI Learning, Delhi.

Bibliographic information