| Introduction to Formal Languages | 7 Part I: Non-deterministic FA | Context-free Languages and Pushdown Automata | 18 Part 1:
Decidability |
| 2 Languages | 7 Part II:
Kleene's Theorem |
12 Context-Free Grammars | 18 Part II:
PDA Transducers |
| 3 Recursive Definitions | 8 FA with Output | 13 Grammatical Format | Turing Machines and Recursively Enumerable Languages |
| Regular Languages and Finite Automata | 9 Regular Languages | 14 Pushdown Automata | 19 Turing Machines |
| 4 Regular Expressions | 10 Nonregular Languages | 15 CFG = PDA | 23 TM Languages |
| 5 Finite Automata | 11 Decidability | 16 Non-Context-Free Languages | Languages, Grammars, and Automata |
| 6 Transition Graphs | 17 Context-Free Languages | 24 The Chomsky Hierarchy |