| Date |
Topic |
Reading |
Assignment |
| Sept 5 |
Administrativia & Intro |
Lec. 1 |
hwk 0 |
| 7 |
Math Review, Strings & Languages |
Lec. 2 |
|
| 10 |
Finite Automata & Regular Sets |
Lec. 3 |
hwk 1 |
| 11 |
(MUL) More on Regular Sets |
Lec. 4 |
|
| 12 |
Nondeterministic Finite Automata |
Lec. 5 |
|
| 14 |
The Subset Construction |
Lec. 6 |
hwk 2 |
| 24 |
Breather |
Lec. 1-6 |
|
| 26 |
Limitations of Finite Automata |
Lec. 11 |
hwk 3 |
| 27 |
(MUL) Using the Pumping Lemma |
Lec. 12 |
|
| 28 |
Pattern Matching |
7 |
|
| Oct 1 |
Pattern Matching & Regular Expressions |
8 |
hwk 4 |
| Oct 1 |
Midterm 1 |
| 3 |
Regular Expressions & Finite Automata |
Lec. 9 |
|
| 4 |
(MUL) Context-Free Grammars & Languages |
Lec. 19 |
hwk 5 |
| 5 |
Balanced Parentheses |
Lec. 20 |
|
| 15 |
Normal Forms |
Lec. 21 |
|
| 17 |
Pumping Lemma for CFLs |
Lec. 22 |
hwk 6 |
| 19 |
Pumping Lemma for CFLs |
Lec. 22 |
|
| Fall Recess |
| Oct 29 |
Midterm 2 |
| 31 |
Pushdown Automata |
Lec. 23 |
hwk 7 |
| Nov 2 |
PDAs and CFGs |
Lec. 24 |
|
| Nov 5 |
Turing Machines |
Lec. 28 |
|
| 7 |
More on Turing Machines |
Lec. 29 |
hwk 8 |
| 8 |
(MUL) Equivalent Models |
Lec. 30 |
|
| 9 |
Universal Machines & Diagonalization |
Lec. 31 |
|
| 12 |
Decidable & Undecidable Problems |
Lec. 32 |
|
| 14 |
Reductions |
Lec. 33 |
hwk 9
|
| 16 |
Rice's Theorem |
Lec. 34 |
|
| 19 |
Undecidable Problems about CFLs |
Lec. 39 |
|
| Nov 21 |
Midterm 3 |
|
|
| 26 |
Goedel's Incompleteness Theorem |
|
hwk 10 |
| 28 |
Proof of Goedel's Incompleteness Theorem |
|
|
| 30 |
|
|
|
| Dec 3 |
|
|
hwk 11 |
| 5 |
|
|
|
| 7 |
|
|
|
| 10 |
|
|
|
| 12 |
|
|
|
| Dec 20 |
Final. 2-4pm. |