| Week |
|
|
|
|
|
|
| 1 | Thurs | Sept 5 | Intro , C1:Sets, Functions, Relations, Languages | Martin 1.1 - 1.5 | ||
| Tues | Sept 10 | C2: Recursive Definitions / Proofs | Martin 2 | HW #1 assigned (C1,C2) | ||
| 2 | Thurs | Sept 12 | C3: Regular Expressions | Martin 3.1 - 3.2 | ||
| Tues | Sept 17 | C3: Finite Automata | Martin 3.3 - 3.5 | HW#2 assigned (C3) | HW #1 due | |
| 3 | Thurs | Sept 19 | C4: NFAs, NFA-lambda | Martin 4.1 - 4.2 | ||
| Tues | Sept 24 | C4: Kleene Theorem | Martin 4.3 | HW#3 assigned (C4) | HW #2 due | |
| 4 | Thurs | Sept 26 | C5: Decision Algorithms :Minimal FA | Martin 5.1 - 5.2 | ||
| Tues | Oct 1 | C5:
Pumping Lemma
C6: Context Free Grammars |
Martin 5.3-5.4 Martin 6.1 - 6.3 |
HW#4 assigned (C5) | HW #3 Due | |
| 5 | Thurs | Oct 3 | C6: CFLs and Regular Languages | Martin 6.4 | HW #4 early submission | |
| Tues | Oct 8 | Midterm Review | HW #4 due | |||
| 6 | Thurs | Oct 10 | MIDTERM EXAM | |||
| Tues | Oct 15 | C6:
Dervation Trees / Ambiguity
C7: Pushdown Automata |
Martin 6.5, 7.1 - 7.3 | HW #5 assigned (C6) | ||
| 7 | Thurs | Oct 17 | C7: CFG <-> PDA Equivalence | Martin 7.4 - 7.6 | ||
| Tues | Oct 22 | C8: CFG:
Chomski Normal Form/Pumping Lemma/
Closure and Decision Properties of CFLs |
Martin 6.6, 8.1 - 8.3 | HW #6 assigned (C7) | HW #5 due | |
| 8 | Thurs | Oct 24 | C9: Turing Machines I | Martin 9.1 - 9.3 | ||
| Tues | Oct 29 | C9/10: Turing Machines II / Recursive & Recursive Enumerable Languages | Martin 9.4 - 9.6, 10.1,2,5 | HW#7 assigned (C8,9) | HW #6 due | |
| 9 | Thurs | Oct 31 | C10: Unrestricted Grammars | Martin 10.3 - 10.4 | ||
| Tues | Nov 5 | C11: Unsolvable Problems | Martin 11.1 - 11.6 | HW#8 assigned (C9,10) | HW #7 due | |
| 10 | Thurs | Nov 7 | C13/14: Computational Complexity | Martin 13.1-2, 14.1-3 / notes | ||
| Tues | Nov 12 | Final Exam Review | HW #8 due |
Final Exam: Saturday, November 16th, 12:30pm-2:30pm, 07-1420