The Book overing finite automata, regular languages, grammars, context-free languages, pushdown automata, Turing machines, decidability, recursive functions, and complexity theory.
Clear explanations supported by diagrams and step-by-step derivations
Worked examples to strengthen conceptual understanding
Solved and unsolved exercises for practice
Summary sections for quick revision.
Theory of Computation of Formal Languages and Automata Theory included variety of examples solved, exercise, suitable for B.Tech, M.Tech students of Computer Science, IT, etc