[For the homework calendar, see the homework page.]
| Week | Date (Wed) | Topic |
|---|---|---|
| 1 | January 18 | Lecture 1: Languages & Set Theory. |
| 2 | 25 | Lecture 2: Regular Expressions and Finite Automata (revised). |
| 3 | February 1 | Lecture 3: Finite automata: Closure properties and regular languages. |
| 4 | 8 | Lecture 4: Automata manipulations. |
| 5 | 15 | Lecture 5: State Minimization, CFLs and PDAs |
| 6 | 22 | Lecture 6: CFLs and PDAs |
| 7 | March 1 | Lecture 7: PDAs, CFLs, and CFL Closure, and Pumping Lemmas (in-lecture version; cleaned-up version) |
| 8 | 8 | Lecture 8: CFL Pumping Lemma, CFL membership, DCFLs, Parsing.(in-lecture version; cleaned-up version) Sections 3.5, 3.6, and 3.7 |
| 9 | 15 | No class - Spring Break |
| 10 | 22 | Exam 1 (Chapters 1 and 2); Lecture 9: Section 3.7. |
| 11 | 29 | Lecture 10: Exam 1 Discussion; LR Parsing; DCFL Properties |
| 12 | April 5 | Lecture 11: Turing Machines |
| 13 | 12 | Lecture 12: Turing Machine Computations; Unrestricted Grammars |
| 14 | 19 | Exam 2 (Chapter 3.1 – 3.5); Lecture 13: Undecidability |
| 15 | 26 | Lecture 14: Undecidability and Computational Complexity |
| 16 | May 3 | Lecture 15: Formal Languages for Proofs (Not on the Final Exam) |
| 17 | Final Exam: As specified by the Spring 2006 Final Exam schedule, our Final Exam will be 7:30 - 9:30 pm, Wednesday May 10. | |
This page is http://www.cs.iit.edu/~cs532
Posted: Mon May 22, 2006.
Copyright © 2006 (Spring) by James Sasaki, CS Dept., Illinois Institute of Technology