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