| Week | Day | Date | Topic | Reading | Special |
| 1 | 1 | March 28 | Intro / Pretest / Sets / Strings | Chapter 0 | |
| 2 | 2 | April 1 | Finite State Automata | pages 31 - 44 | |
| 3 | April 2 | Finite State Automata | pages 31 - 44 | ||
| 4 | April 4 | Regular Operations | pages 44 - 45 | ||
| 3 | 5 | April 8 | Closure Theorems | pages 45 - 47 | Homework 1 due |
| 6 | April 9 | Nondeterministic Finite Automata | pages 47 - 54 | ||
| 7 | April 11 | NDFA --> DFA | pages 54 - 58 | ||
| 4 | 8 | April 15 | Closure Theorems again | pages 58 - 63 | |
| 9 | April 16 | Regular Expressions Regular Expression --> DFA | pages 63 - 69 | Homework 2 due | |
| 10 | April 18 | Review | |||
| 5 | 11 | April 22 | Exam 1 | ||
| 12 | April 23 | DFA --> Regular Expression | pages 69 - 76 | ||
| 13 | April 25 | Pumping Lemma for Regular Languages | pages 77 - 83 | ||
| 6 | 14 | April 29 | Context-Free Grammars | pages 91 - 97 | |
| 15 | April 30 | more Context-Free Grammars DFA --> CFG | pages 91 - 97 | ||
| 16 | May 2 | Pushdown Automata | pages 101 - 106 | Homework 3 due | |
| 7 | 17 | May 6 | CFG to PDA | pages 106 - 110 | |
| 18 | May 7 | Pumping Lemma for Context Free Grammars | pages 115 - 119 | ||
| 19 | May 9 | Turing Machines | pages 125 - 135 | ||
| 8 | 20 | May 13 | more Turing Machines | pages 125 - 135 | Homework 4 due |
| 21 | May 14 | Review | |||
| 22 | May 16 | Exam 2 | |||
| 9 | 23 | May 20 | Variations of Turing Machines | pages 136 - 142 | |
| 24 | May 21 | What is an Algorithm Church's Thesis | pages 142 - 147 | ||
| 25 | May 23 | Decidability Decidable Languages | pages 151 - 158 | ||
| 10 | 26 | May 28 | Diagonalization Method The Universal Turing Machine | pages 159 - 164 | |
| 27 | May 30 | The Halting Problem | pages 165 - 168 | Homework 5 due | |
| June 2 - June 7 | Final Exam Week | ||||
Last Updated: March 27, 2002 7:41 a.m. by