Katson Theory of Automata and Computation by Adesh K. Pandey

Content

Section-A:

• Finite Automata
• Regular Expression
• Introduction to Machines

 Section-B:

• Properties of Regular Sets
• Context-Free Grammars and Languages
• Simplified Context-Free Grammar and its Normal Form

 Section-C:

• Pushdown Automata
• Properties of Context-Free Languages
• Turing Machine

 Section-D:

• Chomsky Hierarchies
• Computability and Recursive Function Theory
• Short Questions with Answers