Table of Contents
- Chapter 1. Introduction and Basic Concepts
- Chapter 2. Finite Automata
- Chapter 3. Regular Expressions
- Chapter 4. Regular and Non - Regular Languages
- Chapter 5. Context - Free Grammars and Languages
- Chapter 6. Pushdown Automata
- Chapter 7. Properties Of Context - Free Languages
- Chapter 8. Turing Machines
- Chapter 9. Recursively Enumerable Languages and Decidability
- References,Model Question Papers,Examination Paper, Index.