Formal languages and automata theory is the study of abstract machines and how these can be used for solving problems. The book has a simple and exhaustive approach to topics like automata theory, formal languages and theory of computation. 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.

Contents

Chapter 1 : Basic Terminology

Chapter 2 : Language and Grammar

Chapter 3 : Finite Automata

Chapter 4 : Finite State Machine

Chapter 5 : Regular Expression

Chapter 6 : Context-free Grammar

Chapter 7 : Pushdown Automata

Chapter 8 : Turing Machine

Chapter 9 : Variations of the Turing Machine

Chapter 1 0 : Computability and Undecidability

Chapter 11 : Recursive Funct ion

Chapter 12 : Computational Complexity

Chapter 13 : Basics of Compiler Design

Chapter 14 : Advance Topics Related to Automata