| Week | Date | Topic/Read Before Class | Assignment |
| 1 | M, 09/04 | Labor day: no class | |
| W, 09/02 | Course information, go over the syllabus,
Section 1.1 Set Theory |
Homework 1 (pdf) | |
| F, 09/05 | Section 1.1 Set Theory (cont'd) | ||
| 2 | M, 09/08 | Section 1.2 Cartesian Product, Relations | |
| W, 09/10 | Review homework 1 Section 1.3 Equivalence Relations |
Homework 2 (pdf) | |
| F, 09/12 | Section 1.3 Equivalence classes, Set Partitions Section 1.2 Functions |
||
| 3 | M, 09/15 | Section 1.2 Functions (cont'd) Section 1.4 Countable Sets |
|
| W, 09/17 | Review homework 2 Section 1.6 Recursive Definitions Section 1.7 Mathematical Induction |
Homework 3 (pdf) | |
| F, 09/19 | Section 2.1 Strings and Languages | ||
| 4 | M, 09/22 | Section 2.2 Finite Specification of Languages Section 2.3 Regular Sets and Expressions | |
| W, 09/24 | Review homework 3 Section 2.3 Regular Sets and Expressions |
Homework 4 (pdf) | |
| F, 09/26 | Midterm exam 1 Sections covered: 1.1, 1.2, 1.3, 1.4, 1.6, 1.7, 2.1 Sections NOT covered: 1.5, 1.8 |
||
| 5 | M, 09/29 | Section 2.3 Regular Sets and Expressions Section 2.4 Regular Expressions and Text Searching |
|
| W, 10/01 | Review homework 4 Section 3.1 Context-Free Grammars and Languages |
Homework 5 (pdf) | |
| F, 10/03 | Section 3.1 Context-Free Grammars and Languages (cont'd) Section 3.2 Examples of Grammars and Languages |
||
| 6 | M, 10/06 | Section 3.2 Examples of Grammars and Languages (cont'd) Section 3.3 Regular Grammars and Languages |
|
| W, 10/08 | Review homework 5 Section 3.5 Leftmost Derivations and Ambiguity |
Homework 6 (pdf) | |
| F, 10/10 | Section 4.1 Grammar transformations | ||
| 7 | M,10/13 | Section 4.2 Elimination of λ-Rules | |
| W, 10/15 | Review homework 6 Section 4.3 Elimination of Chain Rules |
Homework 7 (pdf) | |
| F, 10/17 | Section 4.4 Useless symbols Section 4.5 Chomsky Normal Form |
||
| 8 | M, 10/20 | Review Section 4.3 Elimination of Chain Rules
(handout in pdf) Section 4.6 The CYK algorithm |
|
| W, 10/22 | Review homework 7 Review the four algorithms (handout) Section 4.6 The CYK algorithm (cont'd) |
Homework 8 (pdf) | |
| F, 10/24 | Section 4.6 The CYK algorithm (cont'd)
(handout in pdf) Section 4.7 Removal of Direct left Recursion |
||
| 9 | M, 10/27 | Midterm exam 2 Sections covered: 2.2, 2.3, 3.1, 3.2, 3.3, 3.5, 4.1, 4.2, 4.3 Sections NOT covered: 2.4, 3.4, 3.6 |
|
| W, 10/29 | Review homework 8 Section 4.8 Greibach normal form |
Homework 9 (pdf) | |
| F, 10/31 | Review the Halloween bonus assignments Section 19.1 Lookahead in context-free grammars |
||
| 10 | M, 11/03 | Section 19.2 FIRST, FOLLOW, and LOOKAHEAD sets Section 19.4 Construction of FIRSTk sets (The FIRST set algorithm in pdf) |
|
| W, 11/05 | Review homework 9 Section 19.4 Construction of FIRSTk sets |
Homework 10 (pdf) | |
| F, 11/07 |
Section 19.5 Construction of FOLLOWk sets (The FOLLOW set algorithm in pdf) (A detailed trace of the FOLLOW set algorithm in pdf) | ||
| 11 | M, 11/10 |
Section 5.1 A Finite-State Machine Section 5.2 Deterministic Finite Automata |
|
| W, 11/12 | Review homework 10 | Homework 11 (pdf) | |
| F, 11/14 | Midterm exam 3 Sections covered: 4.4, 4.5, 4.6, 4.7, 4.8, Algorithm 19.4.1(FIRSTk sets) Moved to the final exam: 19.1, 19.2, 19.3, 19.4, 19.5 Sections NOT covered: 19.6, 19.7, 19.8 |
||
| 12 | M, 11/17 |
Section 5.3 State Diagrams and Examples (Theorem 5.3.3: "complementing" the language of a DFA) |
|
| W, 11/19 | Section 5.4 Nondeterministic Finite Automata | ||
| F, 11/21 | Section 5.5 λ-Transitions | ||
| -- | M, 11/24 | Thanksgiving recess | |
| W, 11/26 | Thanksgiving recess | ||
| F, 11/28 | Thanksgiving recess | ||
| 13 | M, 12/01 |
Section 5.5 λ-Transitions (cont'd) Section 6.1 Finite-State Acceptance of Regular Languages |
|
| W, 12/03 | Section 5.6 Removing nondeterminism (handout in pdf) | ||
| F, 12/05 | Section 7.1 Pushdown automata | Homework 12 (pdf) | |
| 14 | M, 12/08 | no class | |
| W, 12/10 | no class | ||
| F, 12/12 | Review homework 12 | ||
| Finals | W, 12/17 |
Final Exam on Wednesday (12/17) at 10:15am Place: Fisher 139 (NOT the usual classroom) Sections covered: 1.7 19.1, 19.2, 19.3, 19.4, 19.5 5.1, 5.2, 5.3, 5.4, 5.5, 5.6 6.1 7.1 Sections NOT covered: 5.7, 6.2 -- 6.7, 7.2 -- 7.5 ( OSSR's schedule ) |
Good luck! |
Note: A week-long homework is assigned every Wednesday.