AUTOMATA THEORY: A STEP-BY-STEP APPROACH

• Presents the essentials of Automata Theory in an easy-to-follow manner.
• Includes intuitive explanations of theoretical concepts, definitions, algorithms, steps and techniques of Automata Theory.
• Examines in detail the foundations of Automata Theory such as Language, DFA, NFA, CFG, Mealy/Moore Machines, Pushdown Automata, Turing Machine, Recursive Function, Lab/Practice Work, etc.
• More than 700 solved questions and about 200 unsolved questions for student's practice.
• Apart from the syllabus of B. Tech (CSE & IT), M. Tech. (CSE & IT), MCA, M. Sc. (CS), BCA, this book covers complete syllabi of GATE (CS), NET and DRDO examinations.

• Mathematical Foundations • Theory of Automata: Alphabet, Strings and Languages • Regular Expression • Finite Automata • Pushdown Automata • Finite State Automata with Output-Moore and Mealy Machine • Introduction to Context-Free Grammars • Equivalence of PDA's and CFG's • Pumping Lemma • Turning Machines • Decidability, Undecidability and Recursive Function Theory • Lab/Practice Work