Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines.
Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems.
1. Automata Theory and Formal Languages - p. Page i 2. Cover - p. Page i 3. Front Matter - p. Page i 4. Table of Contents - p. Page iii 5. Copyright - p. Page iii 6. Dedication - p. Page iv 7. Contents - p. Page vi 8. List of figures - p. Page vi 9. List of tables - p. Page ix 10. Biography - p. Page xi 11. Preface - p. Page xiii 12. List of Illustrations - p. Page xvi 13. List of Tables - p. Page xvii 14. 1 : Background and fundamentals - p. Page xvii 15. 2 : Finite automata and machines - p. Page 19 16. 3 : Regular expressions, regular language and grammar - p. Page 70 17. 4 : Context-free grammar - p. Page 104 18. 5 : Pushdown automata - p. Page 131 19. 6 : Turing machine - p. Page 157 20. 7 : Applications of automata - p. Page 179 21. 8 : Automata theory with recent trends - p. Page 186 22. A : Answers to multiple choice questions - p. Page 197 23. B : Notations - p. Page 201 24. Index - p. Page 204
Automata Theory and Formal Languages presents the difficult concepts of automata theory in a straightforward manner, including discussions on diverse concepts and tools that play major roles in developing computing machines, algorithms and code. Automata theory includes numerous concepts such as finite automata, regular grammar, formal languages, context free and context sensitive grammar, push down automata, Turing machine, and decidability, which constitute the backbone of computing machines. This book enables readers to gain sufficient knowledge and experience to construct and solve complex machines.
Each chapter begins with key concepts followed by a number of important examples that demonstrate the solution. The book explains concepts and simultaneously helps readers develop an understanding of their application with real-world examples, including application of Context Free Grammars in programming languages and Artificial Intelligence, and cellular automata in biomedical problems.
1. Automata Theory and Formal Languages - p. Page i 2. Cover - p. Page i 3. Front Matter - p. Page i 4. Table of Contents - p. Page iii 5. Copyright - p. Page iii 6. Dedication - p. Page iv 7. Contents - p. Page vi 8. List of figures - p. Page vi 9. List of tables - p. Page ix 10. Biography - p. Page xi 11. Preface - p. Page xiii 12. List of Illustrations - p. Page xvi 13. List of Tables - p. Page xvii 14. 1 : Background and fundamentals - p. Page xvii 15. 2 : Finite automata and machines - p. Page 19 16. 3 : Regular expressions, regular language and grammar - p. Page 70 17. 4 : Context-free grammar - p. Page 104 18. 5 : Pushdown automata - p. Page 131 19. 6 : Turing machine - p. Page 157 20. 7 : Applications of automata - p. Page 179 21. 8 : Automata theory with recent trends - p. Page 186 22. A : Answers to multiple choice questions - p. Page 197 23. B : Notations - p. Page 201 24. Index - p. Page 204
