• Current Week: 12

Weekly Notes	Topics	Reading	Assignments
Week 1	Syllabus Survey Introduction to the course Math Background A few words on proofs	Preface Chapter 0	HW1 is here Due Wed 9/9/09
Week 2	1.1a: Regular Languages & Automata 1.1b: Regular Operations and Closure	Chapter 1	HW1 is here Due Wed 9/9/09 HW2 is is now ready Due Mon 9/14/09 Wed 9/16/09.
Week 3	1.1b: Regular Operations and Closure 1.2: Nondeterminism	Chapter 1	HW2 is is here. Due Mon 9/14/09 Wed 9/16/09. HW3 is here
Week 4	1.2: Nondeterminism 1.3: Regular Expressions Regular Expressions (old notes)	Chapter 1	HW3 is here Due Fri 9/25/09 Mon 9/28/09
Week 5	Exam NEXT week Exam topics 1.2: Nondeterminism 1.3: Regular Expressions	Chapter 1	HW4 is here Due Wed 10/7/09 Exam MONDAY 10/12/09
Week 6	Exam: Monday next week 1.4: Non-Regular Languages - Pumping Lemma FAQ on the Pumping Lemma	Chapters 1, 2	HW4 is here Due Wed 10/7/09 Exam MONDAY 10/12/09
Week 7	Finish Non-Regular Languages - Pumping Lemma Begin Context Free Languages: Context Free Grammars	Chapters 1, 2	HW5 is ready here Due Mon 10/19/09
Week 8	Friday is last day to withdraw from a class with a W Context Free Languages: Context Free Grammars Pushdown Automata	Chapter 2	HW5 is here Due Mon 10/19/09 HW6 is here Due Wed 10/28/09
Week 9	Context Free Grammars Pushdown Automata Pumping lemma for regular languages Pumping lemma for context free languages		HW7 is here Due Wed 11/04/09 HW8 is here Due Fri 11/06/09 HW9 is here Due 3:30 Tues 11/11/08
Week 10	Pushdown Automata - PDA → CFL Pushdown Automata - CFL → PDA Pumping lemma for context free languages	Chapter 2	HW8 is here Due Again: Tues 11/4/08 HW9 is here Due 3:30 Tues 11/11/08
Week 11	Exam Monday of next week - 11/16/09 Proof of the Pumping lemma for Context Free Languages Deterministic PDA < Nondeterministic PDA Turing Machines: Introduction Turing Machines Variants: Multitape machines	Chapters 2 and 3	HW9 is here.
Week 12	Exam 2 this week: Wednesday 11/18/09 Monday 11/16/09 (topics) Exam Review Session: Monday 11/16/09, 3:00 p.m., Location: DA 216 Turing Machines Variants (3.2): Multitape machines Nondeterministic and Deterministic machines Enumerators Decidable and Recognizable Languages (3.2) Church-Turing Thesis (and Hilbert's Problem) (3.3) Hilbert's Problem is Recognizable but not Decidable!		Exam 2: Monday 11/16/09
Week 13	Thanksgiving Week!
Week 14	Decidability Machines (4.1) Decidable Languages: ADFA, ANFA, ARE, EDFA, EQDFA, ACFG, ECFG The Halting Problem (4.2) ATM is NOT Decidable, but it is Recognizable ATM' is NOT Recognizable		HW10 is here. Due Wed after break: 3.2.a; 3.2.b; 3.7; 3.8; Homework 11: Due ???: 3.15.b,d,e; 3.16.b,d; 4.2; 4.3
Week 15	Chapter 5: Reducibility, more undecidable problems (HALTTM, ETM, EQTM), and the Post Correspondence Problem: Chapter 7: Complexity Chapter 7: Overview Chapter 7: Sections 1 and 2 Chapter 7: Sections 3, 4, and 5 Topics for Final Exam		HW11 is here. Homework 11: Due Mon 12/8: 3.15.b,d,e; 3.16.b,d; 4.2; 4.3
Week 16	Comprehensive Final Exam:   12:30 p.m. - 2:30 p.m., Tuesday, 12/16/2008		Comprehensive Final Exam
Notes for entire semester

• Note that the weekly notes column above is deprecated, as is the notes for the entire semester.


• Check my grades


• Syllabus


• Text web page (includes errata): www-math.mit.edu/~sipser/book.html