Finite Automata (DFA, NFA) and Regular Expressions.
While the subject is theoretical, Nagpal emphasizes the design and applications of Turing Machines and the relevance of automata in compiler design and AI.
It provides an in-depth look at the four levels of grammars and their corresponding automata: Formal Languages And Automata Theory C.k. Nagpal Pdf
You can find new and used copies at stores like Amazon.in or through the Oxford University Press India catalog.
According to reviewer perspectives from Amazon India , the book is highly recommended for its student-friendly approach: Finite Automata (DFA, NFA) and Regular Expressions
Every chapter ends with a "Quick Review," objective-type questions, and practice problems to reinforce learning.
The book includes historical write-ups paying homage to the scientists who shaped the field, along with detailed sections on the Church-Turing Thesis and Gödel Numbering . Where to Find the Book For those looking to purchase or access the text: According to reviewer perspectives from Amazon India ,
Context-Free Grammars (CFG) and Pushdown Automata (PDA). Context-Sensitive Languages: Linear Bounded Automata (LBA). Recursively Enumerable Languages: Turing Machines (TM).