| Dates | Special | Week | Topic |
| Module 1: Automata | Aug 19 -25 | Labor Day (Sept 2), Census Date (Aug 30) | 1 | Overview of Proofs, Computability, Languages. Review: Basic Set Theory, Logic, Set Notation and Operations, Powerset, Logical Quantifiers, Proof Techniques |
| Aug 26 – Sep 1 | 2 | Finite State Machines, Deterministic Finite Automata |
| Sep 2 – Sep 8 | 3 | NFAs, DFA/NFA Conversion |
| Sep 9 – Sep 14 | 4 | Regular Expressions, Thompson’s Construction |
| Sep 16 – 22 | 5 | Non-regular languages, “Regex” |
| | |
| | |
| | | | |
| Dates | Special | Week | Topic |
| Module 2: Grammars | Sep 22 – Sep 29 | Wellness Day – No Office Hours. Drop/Rev Deadline | 6 | Regular Grammars, CFGs |
| Sep 30 – Oct 6 | 7 | CFG Derivations, PDA |
| Oct 7 – 13 | 8 | PDA/CFG Equivalence |
| Oct 14 – 20 | 9 | Review |
| Oct 21 -27 | 10 | PL for CFL |
| | |
| | |
| | | | |
| Session | Dates | Special | Week | Topic |
| Module 3: Computability | Oct 28 – Nov 3 | Thanksgiving | 11 | Turing Machines |
| Nov 4 – Nov 10 | 12 | Decidability |
| Nov 11 -17 | 13 | Complexity |
| Nov 18 – 24 | 14 | Coping with Intractability (P vs. NP) |
| Nov 25 – Dec 1 | 15 | NP-Reductions |
| Dec 2 – 8 | 16 | Review |
| | |
| | |