| Week | Date | Topic | Special |
| 1 | January 4 | Intro / Sets / Strings Finite State Automata | |
| 2 | January 11 | Regular Operations Closure Theorems Nondeterministic Finite Automata NDFA ==> DFA | Problem Set 1 due |
| 3 | January 18 | Regular Expressions Regular Expression <==> DFA Pumping Lemma for Regular Languages | Problem Set 2 due |
| 4 | January 25 | Snow Day | Problem Set 3 due |
| 5 | February 1 | Context Free Grammars Chomsky Normal Form Pushdown Automata | Problem Set 4 due |
| 6 | February 8 | PDA ==> CFG Pumping Lemma for Context Free Grammars | MIDTERM EXAM |
| 7 | February 15 | Turing Machines | Problem Set 5 due |
| 8 | February 22 | more Turing Machines Variations of Turing Machines What is an Algorithm | Problem Set 6 due |
| 9 | February 29 | Universal Turing Machine Decidability The Halting Problem | Problem Set 7 due |
| 10 | March 7 | Reducibility | Problem Set 8 due |
| 11 | March 14 | FINAL EXAM |
Last Updated: February 10, 2000 10:05 am by