Tentative Schedule

Day	Topic & Slides	Chapter
Monday January 24	Introduction	0
Thursday January 27	Languages	0
Monday January 31	Finite Automacdta, Regular Languages	1
Thursday February 3	Nondeterministic Finite Automata	1
Monday February 7	Properties of Regular Languages Regular Expressions	1
Thursday February 10	Pumping Lemma for Regular Languages	1
Monday February 14	More Pumping Lemma Examples	1
Thursday February 17	Review Class for Regular Languages
Monday February 21	No class -- Presidents day
Thursday Febraury 24	EXAM 1 on Regular Languages
Monday February 28	Context-Free Grammars & Languages	2
Thursday March 3	Grammar Normal Forms Compilers & Parsers	2
Monday March 7	Pushdown Automata	2
Thursday March 10	Pushdown Automata & Context-Free Lang.	2
Week of March 14	SPRING BREAK HOLIDAYS AT RPI.	2
Monday March 21	Turing Machines	3
Thursday March 24	Variations of Turing Machines	3
Monday March 28	Review Class for Context-Free languages
Thursay March 31	EXAM 2 on Context-free languages
Monday April 4	Universal Turing Machine	4
Thurday April 7	Decidable Languages Chomsky's Hierarchy	4
Monday April 11	Undecidable Problems	4
Thursday April 14	Reductions for Decidability	5
Monday April 18	Post-Correspondence Problem	5
Thursday April 21	Time Complexity	7
Monday April 25	NP-Completeness – Cook’s Theorem	7
Thursday April 28	NP-Complete Reductions	7
Monday May 2	Approximation Algorithms	9
Thursday May 5	Approximation Algorithms	9
Monday May 9	Interactive Proofs and Probablistic Algorithm9	9

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