Automata, formal languages, and turing mahines /
Sermutlu, Emre
Automata, formal languages, and turing mahines / Emre Sermutlu - [United States] : [publisher not identified], c2020 - v, 340 pages ; 23 cm.
Includes bibliographical references and index.
Preface -- 1. Finite Automata -- 2. Nondeterminism -- 3. Regular Languages -- 4. Regular Expressions -- 5. Pumping Lemma -- 6. Context-Free Grammars -- 7. Different Forms of grammars -- 8. Pushdown Automata -- 9. Non-context Free Languages -- 10. Turing Machines - I -- 11. Turing machines II -- 12. An Undecidable Language -- 13, P and NP -- 14. NP- Complete Problems.
Turing Machines serve as valuable tools for comprehending the theoretical foundations of computer science, providing a panoramic view of all conceivable algorithms. Although this approach is highly enlightening, its abstract nature can pose challenges.
9798690145385
MACHINE THEORY
QA 267.3 .S47 2020
Automata, formal languages, and turing mahines / Emre Sermutlu - [United States] : [publisher not identified], c2020 - v, 340 pages ; 23 cm.
Includes bibliographical references and index.
Preface -- 1. Finite Automata -- 2. Nondeterminism -- 3. Regular Languages -- 4. Regular Expressions -- 5. Pumping Lemma -- 6. Context-Free Grammars -- 7. Different Forms of grammars -- 8. Pushdown Automata -- 9. Non-context Free Languages -- 10. Turing Machines - I -- 11. Turing machines II -- 12. An Undecidable Language -- 13, P and NP -- 14. NP- Complete Problems.
Turing Machines serve as valuable tools for comprehending the theoretical foundations of computer science, providing a panoramic view of all conceivable algorithms. Although this approach is highly enlightening, its abstract nature can pose challenges.
9798690145385
MACHINE THEORY
QA 267.3 .S47 2020