Here is the listing of Best reference books on Formal Languages and Automata Theory.
|1. “Elements of the Theory of Computation” by Harry R. Lewis and Christos H. Papadimitriou
Book Review: The concepts related to theory of computation are clearly presented in the book. The readers do not need any background in mathematics. The authors present the classical and contemporary theories of computation in a very friendly way. The book contains separate chapters on algorithms, complexity analysis and many algorithmic ideas. Each section in a chapter is followed by many problems which will test the understanding of the user. The book covers a full spectrum of modern topics in automation which include recursive function theory, Halting problem, computational complexity theory and many other advancements
|2. “Introduction to Automata Theory, Languages, and Computation” by John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman|
|3. “Automata and Computability” by Dexter C. Kozen
Book Review: The book provides introduction to basic theoretical methods of computability thereby developing rich and varied structure. First part of the book covers finite automata and its properties. The concept of pushdown automata is also covered in the book which further provides a class of models and provides the analysis of context-free languages. The other chapters in the book provide detailed information about turing machines and in-depth analysis of effective computability, decidability and godel’s incompleteness theorems. This book is very useful for students who are experienced in elementary discrete mathematics.
|4. “Introduction to the Theory of Computation” by Michael Sipser
Book Review: This book gives a clear understanding of complex, theoretical concepts in computational theory. The coverage on the concept of deterministic context free languages is very useful for the understanding of parsing and LR(k) grammars. The book provides a firm understanding of basic mathematical properties of computer hardware, software and various other technologies with a blend of practical and philosophical coverage. The book also includes advanced theorems, proofs and mathematical derivations for various studies in theoretical computing.
|5. “Introduction to Languages and The Theory of Computation” by John Martin
Book Review: This book provides an introduction to theory of computation, thereby focusing on formal languages, automata, abstract computation models and computability. It also provides basics of computational complexity and NP-completeness. The book also introduces the mathematical tools that are of some use in the computational theory. This book is very useful for students who do not have a strong background in discrete mathematics. Students go through various computational questions related to topics that will have a vast impact in computer science. The authors also provide discussion and various examples that will help the readers.
|6. “Introduction to Formal Languages, Automata Theory and Computation” by Krithivasan|
|7. “Theory of Automata, Formal Languages and Computation 1st Edition” by S. P. E. Xavier|
|8.”Formal Languages and Automata Theory” by K. Anuradha|
|9. “Theory of Automata and Formal Languages 2nd Edition” by Anand Prakash Shukla|
|10. “Formal Languages And Automata Theory” by C. K Nagpal|
Sanfoundry Global Education & Learning Series – Best Reference Books!