3 Review(s)

The book is designed to serve as a textbook for a single-semester undergraduate course on formal languages and automata theory. The book introduces the reader to the fundamentals of theory of computation. Beginning with finite automata and regular grammars, the book goes on to discuss context-free grammars, push down automata, and Turing machines. Dedicated chapters on undecidability, Chomsky hierarchies and linear bound automata, and intractable problems make this a complete text on automata theory. Written in an easy-to-understand manner, the book includes a large number of solved examples which illustrate problem-solving methodology.