| Week |
|
|
|
|
|
|
| 1 | Mon | Sept 6 | Introduction Review of Discrete Math / Proofs |
Text:
Ch 0 |
||
| Wed | Sept 8 | Discrete
Math Quiz Strings, Languages, Recursive definitions |
HW #1 assigned | |||
| 2 | Mon | Sept 13 | Finite Automata |
Text: Ch 1 | ||
| Wed | Sept 15 | Regular
Operations NFAs FA Problem Session |
HW #2 assigned | HW #1 due (Friday) | ||
| 3 | Mon | Sept 20 | Regular
Operations II FA <-> NFA Equivalence |
|||
| Wed | Sept 22 | Regular
Expressions NFA Problem Session |
HW #3 assigned | HW #2 due (Friday) | ||
| 4 | Mon | Sept 27 | Kleene
Theorem |
|||
| Wed | Sept 29 | FA
Equivalence / Minimization RL / Pumping Lemma Problem Session |
HW #4 assigned | HW#3 due (Friday) | ||
| 5 | Mon | Oct 4 | Myhill-Nerode
Theorem Pumping Lemma |
|||
| Wed | Oct 6 | Context
Free
Grammars / Parse
Trees / Ambiguity PDA Problem Session |
Text: Ch 2 | HW #4 due (Friday) | ||
| 6 | Mon | Oct 11 | Pushdown
Automata Midterm Exam Problem Session |
|||
| Wed | Oct 13 | MIDTERM EXAM |
HW #5 assigned | |
||
| 7 | Mon | Oct 18 | CFG
<->
PDA Equivalence Pumping Lemma for PDA |
Text:
Ch 3 |
||
| Wed | Oct 20 | Turing
Machines Universal TM and Other TM variants TM Problem Session |
HW #6 assigned | HW #5 due (Friday) |
||
| 8 | Mon | Oct 25 | Recursive &
Recursive Enumerable Languages Decidability |
Text:
Ch 4 |
||
| Wed | Oct 27 | Unsolvable
Problems TM Problem Session |
HW #7 assigned | HW #6 due (Friday) | ||
| 9 | Mon | Nov 1 | Reducability Post Correspondence Problem |
Text: Ch 5 | ||
| Wed | Nov 3 | Complexity:
P, NP/ NP
Complete Reducability Problem Session |
notes |
HW#8 assigned | HW #7 due (Friday) | |
| 10 | Mon | Nov 8 | SAT is
NP-Complete (Cook's Theorem) Other NP Complete Problems |
|||
| Wed | Nov 10 | Final
Problem Session (anything goes) |
HW #8 due (Friday) |
Final
Exam: TBA