Theory of Computation and (Application Automata Theory and Formal Languages)

This text book is designed for the first course in Theory of Computation & Application (Automata Theory and Formal Languages) for the students of B.Tech. (CS/IT) and Master of Computer Applications (MCA) programs of Uttar Pradesh Technical University (UPTU), Lucknow, as well as other Indian Universities. At the end of each chapter a summary for quick revision of concepts and an exercise consisting of objective questions, review questions and programming problems have been given.

Key Features:

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
10. Model Question and Examination Papers

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

Anil Kumar Malviya / Malabika Datta