In the reading column, an entry beginning with # denotes a handout. For example, #R1 indicates Handout #R1. Those entries that do not start with # mean they are related to the textbook. For example, An entry such as 0 indicates the whole of Chapter 0; an entry such as 1.1 indicates Section 1 in 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. An entry such as p.13–14 indicates a range from page 13 to page 14.
| Date | Reading | Topic | Homework |
|---|---|---|---|
| 2/11 | 0 | Introduction | |
| 2/13 | p.13–14, p.44–45, #R1 | Formal Languages | |
| 2/15 | 1.1, #R2 | DFAs | |
| 2/18 | 1.1, #R2 | DFAs (continued) | |
| 2/20 | 1.2–p.54, #R2 | NFAs | |
| 2/22 | p.54–58, #R4 | Equivalence of DFAs and NFAs | |
| 2/25 | p.54–58, #R4 | Equivalence of DFAs and NFAs (continued) | hw1 |
| 2/27 | 1.3–p.66, #R3 | Regular Expressions | |
| 3/1 | p.66–76 | Equivalence of FAs and REs | |
| 3/4 | p.58–63 | Closure Properties of Regular Languages | |
| 3/6 | 1.4, #R5 | Pumping Lemma for Regular Languages | |
| 3/8 | Catchup & Review | hw2 | |
| 3/11 | Test 1 | ||
| 3/13 | 2.1 | Context-Free Grammars (CFGs) | |
| 3/15 | 2.1 | Parsing and Ambiguity | |
| 3/18 | p.108–111 | Chomsky Normal Form (CNF) | |
| 3/20 | 2.2–p.116 | Pushdown Automana (PDAs) | |
| 3/22 | 2.2–p.116 | PDAs (continued) | |
| 3/25 | p.117–124 | Equivalence of CFGs and PDAs | |
| 3/27 | p.117–124 | Equivalence of CFGs and PDAs (continued) | |
| 3/29 | 2.3 | Pumping Lemma for CFLs | |
| 4/8 | Closure properties of CFLs | ||
| 4/10 | 3.1 | Turing Machines (TMs) | |
| 4/12 | p.176–178, p.180–182 | Multitape TMs & Enumerators | hw3 |
| 4/15 | p.178–180 | Nondeterministic TMs | |
| 4/17 | Catch-up & Review | hw4 | |
| 4/19 | Test 2 | ||
| 4/22 | 4.1 | Decidable Languages | |
| 4/24 | 4.1 | Decidable Languages (continued) | |
| 4/26 | 4.2-p.209 | Undecidability of ATM | |
| 4/29 | p.209–210 | Turing Recognizability | |
| 5/1 | 5.1 | Problem Reduction | |
| 5/3 | 5.1 | Undecidable Languages | hw5 |
| 5/6 | 5.1 | Undecidable Languages (continued) | |
| 5/8 | 5.2 | PCP | |
| 5/10 | 5.3 | Mapping Reducibility | |
| 5/13 | 7.1–7.3 | P vs NP problems | |
| 5/15 | 7.4 | Polynomial Time Reducibility | |
| 5/17 | 7.4 | Cook-Levin Theorem | |
| 5/20 | 7.5 | NP-complete Problems | |
| 5/22 | Review & Evaluation | hw6 | |