Our files can all be accessed directly from here
| Week Of | Content | Assigned | Due |
|---|---|---|---|
| Jan 18 | Background, Languages | HW1 | |
| Jan 25 | Recursive Definitions, Regular Expressions | HW2, Lab 1 | |
| Feb 01 | Finite Automata, Transition Graphs | HW3 | Lab 1 |
| Feb 08 | Exam Review, EXAM 1 | ||
| Feb 15 | Kleene's Theorem, Finite Automata with Output | HW4, Lab 2 | |
| Feb 22 | Regular and Non-Regular Languages, Decidability | HW5 | Lab 2 |
| Mar 01 | Context-Free Grammars, Grammatical Format | HW6 | |
| Mar 08 | Exam Review, EXAM 2 | Lab 3 | |
| Mar 15 | Pushdown Automata, PDA = CFG | HW7 | Lab 3 |
| Mar 22 | Non-Context-Free Languages, Context-Free Languages | HW8, Lab 4 | |
| Mar 29 | Decidability, SPRING RECESS | HW9 | |
| Apr 05 | Exam Review, EXAM 3 | Lab 4 | |
| Apr 12 | Turing Machines, Post Machines | HW10, Lab 5 | |
| Apr 19 | Minsky's Theorem, Variations of Turing Machines, Turing Machine Languages | HW11 | |
| Apr 26 | The Chomsky Hierarchy, Computers, Exam Review | HW12 | Lab 5 |
| May 03 | FINAL EXAM |