Theory of Automata, Languages & Computation2010

This book is specially designed to suit the requisites of various levels of students studying this subject. It endeavours to provide an excellent and user-friendly presentation of the concepts, essential for an introductory course on automata and computation. The text includes the straightforward explanation of complicated ideas like transition functions, two-way FA, equivalence of two automata, equivalence of two regular expressions, pumping lemma, auxiliary and two-stack PDA, equivalence of two-stack PDAs and Turing machines, PDA for regular and context free languages, and Turing machines for regular and non-regular languages. This book explains how a reader can define the transition function if he/she knows the functioning of an automaton and vice-versa in a very easy way. Every...