3 Review(s)

Key Feature Provides a lucid introduction to theory of computation Includes comprehensive discussions on Turing machines and Chomsky hierarchies Includes a large number of solved examples to illustrate the fundamental concepts Incorporates extensive end-of-chapter exercises, including objective-type questions Contains 5 model question papers to help students prepare for examinations Table of Contents 1. Mathematical Preliminaries 2. Finite-State Automata 3. Regular Expressions 4. Context-free grammars 5. Push down automata 6. Turing Machines 7. Undecidability 8. Intractable Problems