| Date | Topics (A=1-2:30pm, B=2:40-4:10pm) | Due | ||||
|---|---|---|---|---|---|---|
| Tue | 05/31 | A. DFAs. | ||||
| B. NFAs. Introduction and Overview of the Course. | ||||||
| Thu | 06/02 | A. More DFAs and NFAs | ||||
| B. DFA-NFA equivalence | ||||||
| Tue | 06/07 | A. More on DFA-NFA equivalence. Properties of Regular Languages. Regular Operations. | HW1 | |||
| B. Regular Expressions. Regular Expressions-NFA equivalence. | ||||||
| Thu | 06/09 | A. Pumping Lemma. DFA minimization. | ||||
| B. More on DFA minimization. Exam 1(one hour) | ||||||
| Tue | 06/14 | A. Context-Free Grammars, Parse Trees. Push Down Automata | HW2 | |||
| B. PDA-CFG Equivalence | ||||||
| Thu | 06/16 | A.Deterministic PDAs | ||||
| B. Normal Forms for CFG | ||||||
| Tue | 06/21 | A. Pumping Lemma for CFL | HW3 | |||
| B. Properties of CFL | ||||||
| Thu | 06/23 | A. Turing Machines | ||||
| B. Exam 2 | ||||||
| Tue | 06/28 | A. More Turing Machines | HW4 | |||
| B. Undecidability | ||||||
| Thu | 06/30 | A. Reductions, Rice's Theorem | ||||
| B. More Undecidable Problems | ||||||
| Tue | 07/05 | A. P vs NP | HW5 | |||
| B. Cook's Theorem | ||||||
| Thu | 07/07 | A. Review | ||||
| B. Comprehensive Final Exam |
Back up to Summer 2005 CMSC 451 Homepage