English Title : Formal Language and Automata Theory
عنوان فارسی : زبان های رسمی و تئوری خودکار
Description
Formal Languages and Automata Theory deals with the mathematical abstraction model of computation and its relation to formal languages. This book is intended to expose students to the theoretical development of computer science. It also provides conceptual tools that practitioners use in computer engineering. An assortment of problems illustrative of each method is solved in all possible ways for the benefit of students. The book also presents challenging exercises designed to hone the analytical skills of students.
Table of contents
1. Mathematical Preliminaries and Formal Languages
2. Finite Automata
3. Regular Languages and Regular Grammars
4. Context Free Grammars and Context Free Languages
5. Push Down Automata
6. Turing Machines
7. Undecidability and Computability
8. Non-deterministic Polynomial Completeness
9. LR(k) and LL(1) Grammars