Theory Of Automata, Languages & Computation teaches its readers the theoretical basis of computation and the corresponding computational models. The explanation of computational models begins with introducing finite automata and formal languages and then moves to Turing machines. Proper emphasis is placed on giving the reader an understanding of the properties of these models, the relationship among them, and the effect of modifications such as resource bounds and non-determinism on them. The book provides an elaborate coverage of topics such as Finite Automata, Regular Languages, and Pushdown Automata. Concepts are explained exhaustively, and the use of language is simple. A good balance is maintained between theory and mathematical rigor. The introductory chapter, Visual Walkthrough, explains the role of the different features in the book and how they can be used to enhance learning. Two sections, ‘Did You Know’ and ‘Good To Know’, make learning interesting by providing additional facts and information about the subject and its history. A chapter titled Mathematical Preliminaries is especially included so that learners can master the bare essentials of mathematics required for grasping the material in the succeeding chapters. Theory Of Automata, Languages & Computation contains eleven chapters, including Mathematical Preliminaries, Regular Language and Regular Grammar, Finite Automata, Properties of Regular Languages, Formal Languages, Context Free Grammar and Context Free Language, Properties of Regular and Context Free Languages, Push Down Automata, NP-Completeness, and Undecidability and Computability. Review exercises are provided, along with solutions and hints, in addition to multiple-choice questions. There are 110 graded questions, 177 review questions, 140 solved examples, and 286 multiple-choice questions.


General Information  
PublisherMcGraw Hill
Publish YearJanuary 2010