Tentative Schedule

Day	Topic & Slides	Chapter
Tuesday August 28	Introduction	0
Thursday August 30	Languages	0
Tuesday September 4	Deterministic Finite Automata, Regular Languages	1
Thursday September 6	Nondeterministic Finite Automata	1
Tuesday September 11	Properties of Regular Languages
Thursday September 13	Regular Expressions	1
Tuesday September 18	Pumping Lemma for Regular Languages	1
Thursday September 20	More Pumping Lemma Examples	1
Tuesday September 25	Context-Free Grammars & Languages	2
Thursday September 27	Grammar Normal Forms Compilers & Parsers	2
Tuesday October 2	Pushdown Automata	2
Thursday October 4	Pushdown Automata & Context-Free Languages	2
Tuesday October 9	Review for Exam 1
Thursday October 11	No Class – Fall Holiday
Tuesday October 16	Exam 1 (Finite Automata)
Thursday October 18	Pumping Lemma for Context-Free Languages	2
Tuesday October 23	Turing Machines	3
Thursday October 25	Variations of Turing Machines	3
Tuesday October 30	Universal Turing Machine	4
Thursday November 1	Decidable Languages Chomsky's Hierarchy	4
Tuesday November 6	Undecidable Problems	4
Thursday November 8	Review for Exam 2
Tuesday November 13	Exam 2 (Context-Free Languages)
Thursday November 15	Reductions for Decidability	5
Tuesday November 20	Post-Correspondence Problem	5
Thursday November 22	No Class – Thanksgiving Holiday
Tuesday November 27	Time Complexity	7
Thursday November 29	NP-Completeness – Cook’s Theorem	7
Tuesday December 4	NP-Complete Reductions	7
Thursday December 6	Review Class for Final Exam

Extra Material

Mathematical Preliminaries

Decidable problems on Regular and Context-free languages

Grammars for regular languages

Deterministic pushdown automata (DPDA)

Properties of context-free languages

More examples of pumping lemma for context-free languages

Other models of computation