Home Lectures Homeworks Links Announcements
| Week | Lecture | Date | Topic | Reading | Homeworks etc. |
|---|---|---|---|---|---|
| 1 | 1 | 09/04 |
Introduction; Mathematics background | Chap. 0.1-0.4, pp. 203 | Further reading: pp. 203-204. |
| 2 | 2 | 09/09 | Finite automaton, computation of DFA; Design of DFA; Regular langusages; Regular operations | Chap. 1.1 |
|
| 3 | 09/11 | ||||
| 3 | 4 | 09/16 | Closure properties of regular languages; Nondeterminism, design of NFA, proof of closure properties; Regular expressions | Chap. 1.2-1.3 |
09/18: Homework #1 (???) Java Regular Expression Examples |
| 5 | 09/18 | ||||
| 4 | 6 | 09/23 | Conversion between regular expression and NFA; Applications of finite automata; Nonregular languages; Pumping lemma & examples | Chap. 1.4 | 09/25: Handout (GNFA->Reg. Exp.) |
| 7 | 09/25 | ||||
| 5 | 8 | 09/30 | Pumping lemma & examples; Myhill-Nerode Theorem | Handout; Chap. 2.1 | 09/30: InClassExercise |
| 9 | 10/02 | ||||
| 6 | 10 | 10/07 | Context-free grammars, Chomsky Normal Form (CNF); Pushdown automata (PDA); CYK algorithm | Chap. 2.1-2.2 | 10/08: Pass/Fail Deadline |
| 11 | 10/09 | ||||
| 7 | 12 | 10/14 | Non-context-free languages; Pumping lemma for CFLs - in class exercise; Pumping lemma for CFLs - more examples |
CYK Handout | 10/16: Handout (CYK algorithm) |
| 13 | 10/16 | Chap. 2.3 |
|
||
| 8 | 14 | 10/21 | Quick review for midterm exam; Discussions on HW #2,3 | ||
| -- | 10/23 | Midterm exam (in class) | Academic Calendar | ||
| 9 | 15 | 10/28 | Closure properties for CFLs |
Chap. 2.3 | 10/28: InClassExercise (???) |
| 16 | 10/30 | Closure properties for CFLs; The Church-Turing Thesis |
Chap. 2.3 | ||
| 10 | 17 | 11/04 | Discussions on Midterm exam; Turing machines and examples; Configurations of Turing machine; Turing recognizable/decidable languages | Chap. 3.1 | 11/03: Registration for Spring 2026 begins 11/06: Homework #4 (???) |
| 18 | 11/06 | ||||
| 11 | -- | 11/11 | Veterans Day - No classes | Chap. 3.2 | |
| 19 | 11/13 | Variants of Turing machines; Closure property of decidable languages |
Chap. 3.3 | 11/13: Homework #4 Due (???) |
|
| 12 | 20 | 11/18 | Closure property of Turing-recognizable languages; Minsky's Theorem (concept only); Church-Turing Thesis (revisit) | Chap. 4.1; 4.2 |
11/18: Homework #5 (???) |
| 21 | 11/20 | Hilbert's tenth problem; Decidability: Decidable problems for regular languages; Decidable problems for context-free languages | Chap. 5.1; 5.3 | ||
| 13 | 22 | 11/25 | The halting problem; Undecidable problems; Reducibility; Mapping reducibility; Chomsky hierarchy of formal languages | Chap. 5.1; 5.3 | 11/25: Homework #5 Due (???) 11/26: Homework #6 (???) |
| -- | 11/27 | Chap. 5.1; 5.3 | |||
| 14 | 23 | 12/02 | Time complexity; The class P vs class NP | Chap. 7.1-7.4 |
|
| 24 | 12/04 | Polynomial-time reducibility; NP-completeness | |||
| 15 | 25 | 12/09 | Reviews (comprehensive) | Lecture Notes | 12/09: Classes End |
| -- | 12/11 | Final Exams Begin |
|
||
| 16 | -- | 12/15 | Final exam*: Monday, Dec. 15, 3:00pm-6:00pm, Library Lecture Hall 205 | 12/20: Final grades due |
*: Please refer to final exam schedule at: http://www.umassd.edu/registrar/finalexams/