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