Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems.

The book has a simplistic approach to topics like automata theory, formal languages and theory of computation and explains them exhaustively. The difficult topics are described in a step-wise manner, which makes it easy for the students to comprehend them. These descriptions are followed by numerous relevant examples related to the topic.

A brief introductory chapter on compilers explaining its relation to theory of computation is also given.