Introduction to Automata Theory & Formal Languages - For UPTU

Table of Contents:

• Introduction to Concept of Automata
• Finite Automata
• Automata with Output
• Regular Expression and Languages
• Properties of Regular Languages
• Context-Free Grammars and Languages
• Simplified Context-Free Grammar and it’s Normal Form
• Pushdown Automata
• Properties of Context-Free Languages
• Turing Machine
• Recursive Function Theory
• The Chomsky Hierarchy
• Tractable and Intractable Problems
• Appendix: Test Your Skills of Automata
• Model Question Papers
• Unsolved Examination Papers
• Solved Examination Papers
• References
• Index