| Lecture | Date | Topic | Reading | Comments |
| 0 | Friday, 05 September 2003 | Introduction; developing a boolean logic system; sets and sequences | Sipser, pp. 1-24 | homework 0 assigned |
| 1 | Monday, 08 September 2003 | Graphs and Mappings | Sipser, pp. 1-24 |
homework 0 due; homework 1 assigned |
| 2 | Wednesday, 10 September 2003 | Relations, strings, languages | Sipser, pp. 1-24 | |
| 3 | Friday, 12 September 2003 | Inductive definitions, inductive proofs, introduction to deterministic finite automata (DFAs) via parsing well-formed strings from our simple boolean logic | Sipser, pp. 31-43 | |
| 4 | Monday, 15 September 2003 | Formal description of DFAs. Definition of computation, more finite automata | Sipser pp. 43-47 |
homework 1 due; homework 2 assigned |
| 5 | Wednesday, 17 September 2003 | Deterministic Finite Automata | Sipser pp. 47-57 | |
| 6 | Friday, 19 September 2003 | Nondeterminisim; nondeterministic finite automata (NFAs); Equivalence of NFAs and DFAs. | Sipser pp. 58-65 | |
| 7 | Monday, 22 September 2003 | Example of simulating an NFA on a DFA; properties of regular languages; regular operations and their closure; regular expressions |
homework 2 due; homework 3 assigned |
|
| 8 | Wednesday, 24 September 2003 | Equivalence of regular languages and regular expressions | Sipser pp. 66-76 | |
| 9 | Friday, 26 September 2003 | Finish equivalence of regular expressions and regular langauges | Sipser pp. 66-76 | |
| 10 | Monday, 29 September 2003 | Pumping Lemma for Regular languages. | Sipser pp. 77-83 |
homework 3 due; |
| 11 | Wednesday, 01 October 2003 | State Minimization | Topic not covered in text, but available as lecture notes. | |
| 12 | Friday, 03 October 2003 | Non-regular languages | Topic not covered in text, but available as lecture notes. | |
| 13 | Monday, 06 October 2003 | State minimization; Context-Free Grammars | Sipser pp. 91-98 |
homework 4 due; homework 5 assigned |
| 14 | Wednesday, 08 October 2003 | Context-Free Grammars | 99-101 | |
| 15 | Friday, 10 October 2003 | Mountain Day | ||
| No lecture on Monday, 13 October 2003, because of Fall reading period | ||||
| 16 | Wednesday, 15 October 2003 | PDAs, equivalence of PDAs and CFGs | Sipser pp. 101-114 |
homework 5 due; |
| Thursday, 16 October 2003. The take-home exam will be available from 12.00 to 17.00 in my office (room 309). It will be due at 10.00 on Monday, 20 October 2003. I will spend 30 minutes (or so) on Friday, 17 October 2003 answering any questions you might have. I'll be available Sunday in my office, and sedulously check email the entire weekend. | ||||
| 17 | Friday, 17 October 2003 | Questions about midterm, more equivalence of PDAs and CFGs | Sipser pp. 101-114 | |
| 18 | Monday, 20 October 2003 | Pumping Lemma for CFLs. |
homework 6 assigned |
|
| 19 | Wednesday, 22 October 2003 | |||
| 20 | Friday, 24 October 2003 | Decidable and recogniable lagnuages. | ||
| 21 | Monday, 27 October 2003 | Multi-tape TMs and their equivalence with TMs. Introduction to NDTMs. |
homework 7 assigned homework 6 due |
|
| 22 | Wednesday, 29 October 2003 | Equivalence of NDTMs and DTMs. Programs as data. | ||
| 23 | Friday, 31 October 2003 | Universal Turing Machines | Halloween! | |
| 24 | Monday, 3 November 2003 | Encodings; Examples of decidable languages | Sipser pp. 144-158 |
homework 8 assigned homework 7 due |
| 25 | Wednesday, 5 November 2003 | Counting; Diagonalization; Introduction to undecidable languages; | Sispser pp.159-167 | |
| 26 | Friday, 7 November 2003 | Turing-unrecognizable languages. | Sipser pp. 167-168 | |
| 27 | Monday, 10 November 2003 | Examples of undecidable languages; The languages K and ATM | Sipser pp. 158-170 |
homework 9 assigned homework 8 due |
| 28 | Wednesday, 12 November 2003 | Mapping (or many-to-one) reductions. Co-ETM. | Sispser pp. 170-194 | |
| 29 | Friday, 14 November 2003 | Languages not in R.E or Co-R.E; more reductions | Sispser pp. 170-194 | |
| 30 | Monday, 17 November 2003 | Showing ALL-CFG is undecidable; Showing EQ-CFG is undecidable | Sipser 181-182; Sispser 5.1 |
homework 8 assigned homework 9 due |
| 31 | Wednesday, 19 November 2003 | Rice's Theorem | Class notes (although Sipser 5.22 asks your to prove theorem) | |
| 32 | Friday, 21 November 2003 | Sipser pp. | ||