Our files can all be accessed directly from here
| Week Of | Tuesday | Thursday | Due |
|---|---|---|---|
| Jan 21 | Background, Languages | Recursive Definitions | HW1 |
| Jan 28 | Regular Expressions | Finite Automata | HW2 |
| Feb 4 | Transition Graphs | Lab Time | HW3, Lab 1 |
| Feb 11 | Test 1 | Kleene's Theorem | |
| Feb 18 | Kleene's Theorem, Finite Automata with Output | Lab Time | HW4, Lab 2 |
| Feb 25 | Regular and Non-Regular Languages | Decidability | HW5 |
| Mar 4 | Context-Free Grammars | Lab Time | HW6 |
| Mar 11 | SPRING BREAK | SPRING BREAK | HW7, Lab 3 |
| Mar 18 | Test 2 | Grammatical Format | |
| Mar 25 | Pushdown Automata | PDA = CFG, Lab Time | HW8 |
| Apr 1 | Non-Context-Free Languages | Context-Free Languages, Lab Time | HW9, Lab 4 |
| Apr 8 | Decidability | Turing Machines | HW10 |
| Apr 15 | Test 3 | Post Machines | |
| Apr 22 | Minsky's Theorem, Variations of Turing Machines, Turing Machine Languages | Lab Time | HW11 |
| Apr 29 | The Chomsky Hierarchy, Computers | Lab Time | HW12, Lab 5 |