SCHEDULE

Note: The schedule is subject to change. Check back for changes and updates

Semester Timeline
Date	Topic	Readings	Assignments	Notes
Week 1
9/25	Intro Quiz Regular Languages	Chapter 1		Intro DFAs
9/27	Regular Languages			NFAs RegEx
Week 2
10/2	Pumping Lemma			Non-regular
10/4	Myhill-Nerode Theorem		HW 1 Due
Week 3
10/9	Context-Free Languages	Chapter 2		CFGs PDAs
10/11	Context-Free Pumping Lemma		HW 2 Due	CFL pumping lemma
Week 4
10/16	Exam 1
10/18	Turing Machines TM Variants	Chapter 3		Turing Machines
Week 5
10/23	Non-deterministic Turing Machines	Chapter 4
10/25	Undecidability		HW 3 Due	Reductions
Week 6
10/30	Mapping Reductions	Chapter 5
11/1	Unrecognizability Rice's Theorem		HW 4 Due
Week 7
11/6	Time Complexity			Complexity
11/8	Exam 2
Week 8
11/13	P vs NP Overview	Chapter 7		P vs NP
11/15	Cook-Levin Theorem NP-Completeness
Week 9
11/20	Space Complexity Savitch's Theorem	Chapter 8	HW 5 Due	Space Complexity
11/22	Campus Holiday
Week 10
11/27	More Space Complexity
11/29	L and NL		HW 6 Due	Log Space
Finals Week
12/6	Final Exam