Formal Language and Automata Theory
● The book contains an in-depth coverage of all the topics related to the Theory of Computation as mentioned in the syllabuses of B.Tech., M.C.A., MS, M. Tech and M.Sc. (Computer Science) of various universities. Sufficient amount of theoretical inputs supported by a number of illustrations are included for those who take deep interest in this subject.
In the first few chapters, the book presents the necessary basic material for the study of Automata Theories. Examples of topics included are: regular languages and Kleene's Theorem; minimal automata and syntactic monoids; the relationship between context-free languages and pushdown automata; and Turing machines and decidability.
● This book facilitates students a more informal writing style while providing the most accessible coverage of automata theory, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. Each chapter offers an abundance of exercises for hands-on learning.
1. Mathematical Preliminaries
2. Finite Automata and Regular Expressions
3. Regular sets and Regular Grammars
4. Context Free Grammars and Languages
5. Push down Automata
6. Universal Turing Machines and Undecidability