| Day | Topic | Reading in book |
| Tue., April 4, Day 1 (Slides) | Introduction Finite State Automata |
Chapter 0, review 1.1 |
| Thu., April 6, Day 2 (Slides) | Non-Deterministic Finite Automata | 1.2 |
| Tue., April 11, Day 3 (Slides) | Regular Expressions Quiz 1 |
1.3 |
| Thu., April 13, Day 4 (Slides) | Pumping Lemma | 1.4 |
| Tue., April 18, Day 5 (Slides) | Minimizing states of a FSA Quiz 2 |
|
| Thu., April 20, Day 6 (Slides) | Context-Free grammars | 2.1 |
| Tue., April 25, Day 7 (Slides) | Context-free grammars and compilers Quiz 3 |
|
| Thu., April 27, Day 8 (Slides) | Pushdown Automata | 2.2 | Tue., May 2, Day 9 (Slides) | Pumping lemma for context-free languages Quiz 4 |
2.3 | Thu., May 4, Day 10 (Slides) | Context Free Language Wrapup |
| Tue., May 9, Day 11 | Midterm | |
| Thu., May 11, Day 12 (Slides) | Turing Machines | 3.1 |
| Tue., May 16, Day 13 (Slides) | Turing Machine Variants
Quiz 5 |
3.2 |
| Thu., May 18, Day 14 (Slides) (mp3) | Halting Problem
Decidable Languages | 3.3, 4.1-4.2 |
| Tue., May 23, Day 15 (Slides) (mp3) | Reducibility
Quiz 6 |
5.1, 5.3 |
| Thu., May 25, Day 16 (Slides) (mp3) | Post Correspondence Problem | 5.2 |
| Tue., May 30, Day 17 (Slides) (mp3) | Mapping reductions and Turing reductions (5.3 and 6.3) Quiz 7 |
|
| Thu., June 1, Day 18 (Slides) (mp3) | More reductions | 7.1, 7.2 |
| Tue., June 6, Day 19 (Slides) (mp3) | The classes P and NP NP-complete problems Quiz 8 |
7.1, 7.2, 7.3, 7.4 |
| Thu., June 8, Day 20 (Slides) |
NP-complete problems |
7.2, 7.3, 7.4 |
| Sun., June 11 | Final Review 2 PM, CSB 002 | |
| Wed. June 14: 7-10 PM | Final CSB 002 |