| September 7 | Course Overview | |
| September 9 | Finite Automata | |
| September 12 | Regular Languages | |
| September 14 | Non-Determinism | |
| September 21 | From Patterns to NFAs | |
| September 26 | The Pumping Lemma | |
| September 30 | Survey of Finite Automata Topics | |
| October 12 | The Pumping Lemma for CFLs | |
| October 14 | Non-Deterministic Pushdown Automata | |
| October 19 & 21 | One State Is Enough for an NPDA | |
| October 31 | Turing Machines | |
| November 2 | Fun with Turing Machines | |
| November 4 | Proofs | |
| November 28 | CFLs and Valid Computations | |
| December 2 | Programs That Print Themselves | An Example |