Martin

John C. Martin · Fourth edition

Introduction to Languages and the Theory of Computation

1. 01Mathematical Tools and Techniques
2. 02Finite Automata and the Languages They Accept
3. 03Regular Expressions, Nondeterminism, and Kleene’s Theorem
4. 04Context-Free Languages
5. 05Pushdown Automata
6. 06Context-Free and Non-Context-Free Languages
7. 07Turing Machines
8. 08Recursively Enumerable Languages
9. 09Undecidable Problems
10. 10Computable Functions
11. 11Introduction to Computational Complexity