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 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 needn't 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/10 | 0 | Review of Set Theory & Proofs | |
| 2/11 | p.13–14, p.44–45, #F1 | Formal Language Theory | |
| 2/13 | 1.1–p.41, #R1 | Deterministic Finite Automata (DFA's) | |
| 2/14 | p.41–44, #R2 | Designing Automata | |
| 2/17 | 1.2–p.54, #R1 | Nondeterministic Finite Automata (NFA's) | |
| 2/18 | p.41–44, #R2 | Designing Automata (continued), Product Construction | |
| 2/20 | p.54–58, #R3 | Equivalence of DFA's and NFA's | |
| 2/21 | p.54–58, #R3 | Equivalence of DFA's and NFA's (continued) | hw1 |
| 2/24 | 1.3–p.66, #R4 | Regular Expressions (RE's) | |
| 2/25 | . | Designing RE's | |
| 2/27 | p.66–76 | Equivalence of FA's and RE's | |
| 2/28 | p.66–76 | Equivalence of FA's and RE's (continued) | |
| 3/3 | p.58–63 | Closure Properties of Regular Languages | |
| 3/4 | 1.4, #R5 | Pumping Lemma for Regular Languages | |
| 3/6 | Catchup & Review | hw2 | |
| 3/7 | Test 1 | ||
| 3/10 | 2.1 | Context-Free Grammars (CFG's) | |
| 3/11 | . | Designing CFG's | |
| 3/13 | 2.1 | Parsing and Ambiguity | |
| 3/14 | p.108–111 | Chomsky Normal Form (CNF) | |
| 3/17 | 2.2–p.116 | Pushdown Automana (PDA's) | |
| 3/18 | . | Designing PDA's | |
| 3/20 | p.117–124 | Equivalence of CFG's and PDA's | |
| 3/21 | p.117–124 | Equivalence of CFG's and PDA's (continued) | hw3 |
| 3/24 | 2.3, #C4 | Pumping Lemma for CFL's | |
| 3/25 | #C5 | Closure properties of CFL's | |
| 3/27 | . | Decision properties of CFL's | |
| 3/28 | . | Applications of Automata | |
| 3/31 | SPRING BREAK | ||
| 4/1 | SPRING BREAK | ||
| 4/3 | SPRING BREAK | ||
| 4/4 | SPRING BREAK | ||
| 4/7 | Catch-up & Review | ||
| 4/8 | 3.1 | Turing Machines (TM's) | hw4 |
| 4/10 | Test 2 | ||
| 4/11 | #T1 | Designing TM's | |
| 4/14 | p.176–182 | Multitape TMs & Enumerators, and TM variants | |
| 4/15 | p.178–180 | Nondeterministic TMs | |
| 4/17 | 3.2 | Equivalence of TM's | |
| 4/22 | 4.1 | Decidable Languages | |
| 4/24 | 4.2 | The Diagonal Method | |
| 4/25 | 4.2-p.209 | Undecidability of ATM | |
| 4/28 | p.209–210 | Turing Recognizability | |
| 4/29 | 5.1, #RD1 | Problem Reduction | |
| 5/1 | 5.1 | Problem Reduction, continued | |
| 5/2 | 5.1 | Problem Reduction, continued | hw5 |
| 5/5 | 5.1 | Reduction via Computation History | |
| 5/6 | 5.2 | Post Correspondence Problem (PCP) | |
| 5/8 | 5.3 | Mapping Reducibility | |
| 5/9 | 7.1–7.3 | P, NP | |
| 5/12 | 7.4 | NP completeness, poly-time reduction | |
| 5/13 | 7.4 | Cook-Levin Theorem | |
| 5/15 | 7.5 | NP-complete Problems | |
| 5/16 | 7.5 | NP-complete Problems, continued | |
| 5/19 | 7.5 | NP-complete Problems, continued | |
| 5/20 | Review & Evaluation | hw6 | |