| W | L | Date | Topic | Reading | Note |
|---|---|---|---|---|---|
| 1 | 1 | 2009-01-12 | Course agenda, policies, sets, languages, relations | ||
| 2 | 2009-01-14 | Graphs, induction | |||
| 2 | 2009-01-19 | Martin Luther King Jr. Day (no lecture) | |||
| 3 | 2009-01-21 | Deterministic Finite Automata | Sections 2.1, 2.2 | Assignment 2 out | |
| 3 | 4 | 2009-01-26 | Regular Languages (breifly), Nondeterministic Finite Automata, Equivalence to DFA | Section 2.3 | Assignment 2 due |
| 2009-01-28 | Class canceled due to weather | ||||
| 4 | 5 | 2009-02-02 | NDFA with epsilon transitions, equivalence to DFAs | Section 2.5 | |
| 6 | 2009-02-04 | Regular Expressions, equivalence to DFA | Section 3.1 | Assignment 3 due | |
| 5 | 7 | 2009-02-09 | Regular Expressions, Introduction to Pumping Lemma | Section 3.2 | Assignment 4 due |
| 8 | 2009-02-11 | Pumping Lemma Continued | |||
| 6 | 9 | 2009-02-16 | Midterm Review | ||
| 10 | 2009-02-18 | Introduction to Context Free Grammars | Assignment 5 due | ||
| 7 | 2009-02-23 | Midterm I: Induction, DFA, NDFA, Regular Expressions, Pumping Lemma | |||
Unless noted otherwise, chapter and section numbers refer to the chapters and sections from the textbook.