Entries in the reading column are related to our textbook. For example, an entry such as 0 indicates the whole of chapter 0; an entry such as 1.1 indicates section 1 of chapter 1. Sometimes I have indicated an ending page number, such as 1.2-p.54. In those cases, you should read up through the indicated page, though if the page ends with a transitional paragraph, you need not concern yourself with it. An entry such as p.13-14 indicates a range from page 13 to page 14.
| Date | Reading | Topic | Homework |
|---|---|---|---|
| 2/8 | 0 | Review of Set Theory & Proofs | |
| 2/9 | p.13-14, p.44-45 | Formal Language Theory | |
| 2/11 | 1.1-p.41 | Deterministic Finite Automata (DFAs) | |
| 2/12 | 1.2-p.54 | Nondeterministic Finite Automata (NFAs) | |
| . | |||
| 2/15 | p.41-47 | Designing Automata | |
| 2/16 | p.41-44 | Designing Automata (continued), Product Construction | |
| 2/18 | p54-58 | Equivalence of DFAs and NFAs | |
| 2/19 | p54-58 | Equivalence of DFAs and NFAs (continued) | hw1 |
| . | |||
| 2/22 | 1.3-p.66 | Regular Expressions (REs) | |
| 2/23 | Designing REs | ||
| 2/25 | p.66-76 | Equivalence of FAs and REs | |
| 2/26 | p.66-76 | Equivalence of FAs and REs (continued) | |
| . | |||
| 2/29 | p.58-63 | Closure Properties of Regular Languages | |
| 3/1 | 1.4 | Pumping Lemma for Regular Languages | |
| 3/3 | 2.1 | Context-free Grammars (CFGs) | |
| 3/4 | p.106-107 | Designing CFGs | |
| . | |||
| 3/7 | Catchup & Review | hw2 | |
| 3/8 | Test 1 | ||
| 3/10 | 2.1 | Parsing and Ambiguity | |
| 3/11 | p.108-111 | Chomsky Normal Form (CNF) | |
| . | |||
| 3/14 | 2.2-p116 | Pushdown Automata (PDAs) | |
| 3/15 | Designing PDAs | ||
| 3/17 | p.117-124 | Equivalence of CFGs & PDAs | |
| 3/18 | p.117-124 | Equivalence of CFGs & PDAs (continued | |
| . | |||
| 3/21 | 2.3 | Pumping Lemma for CFLs | |
| 3/22 | Closure Properties for CFLs | ||
| 3/24 | Decision Properties for CFLs | ||
| 3/25 | SPRING BREAK | ||
| . | |||
| 3/28 | SPRING BREAK | ||
| 3/29 | SPRING BREAK | ||
| 3/31 | SPRING BREAK | ||
| 4/1 | SPRING BREAK | ||
| . | |||
| 4/4 | Applications of Automata | ||
| 4/5 | Catch-up & Review | ||
| 4/7 | Test 2 | ||
| 4/8 | 3.1 | Turing Machines (TMs) | hw3 |
| . | |||
| 4/11 | Designing TMs | ||
| 4/12 | p.176-182 | DTM variants | |
| 4/14 | p.178-180 | Nondeterministic TMs | |
| 4/15 | 3.2 | Equivalence of TMs | |
| . | |||
| 4/18 | 4.1 | Decidable Languages | |
| 4/19 | 4.2 | The Diagonal Method | |
| 4/21 | 4.2-p.209 | Undecidability of ATM | |
| 4/22 | p.209-210 | Turing Recognizability | |
| . | |||
| 4/25 | 5.1 | Problem Reduction | |
| 4/26 | 5.1 | Problem Reduction, continued | |
| 4/28 | 5.1 | Problem Reduction, continued | |
| 4/29 | 5.2 | Post Correspondence Problem (PCP) | |
| . | |||
| 5/2 | 5.3 | Mapping Reducibility | |
| 5/3 | 7.1-7.3 | P & NP | |
| 5/5 | 7.4 | NP Completeness & poly-time Reduction | |
| 5/6 | 7.4 | Cook-Levin Theorem | |
| . | |||
| 5/9 | 7.5 | NPC Problems | |
| 5/10 | 7.5 | NPC Problems, continued | |
| 5/12 | 7.5 | NPC Problems, continued | |
| 5/13 | 7.5 | NPC Problems, continued | hw4 |
| . | |||
| 5/16 | TBA | ||
| 5/17 | Review & Evaluation |