CS 3133
A term 2008
Worcester Polytechnic Institute

---

Tentative daily schedule

Date	Topic	Sections from the text
R 8/28	Background and Automata	1,2,3
F 8/29	Regular sets	4
M 9/2	Nondeterminism	5
T 9/4	Eliminating nondeterminism	6
R 9/5	Pattern Matching	7,8
F 9/8	Regular Expressions and Automata	9
T 9/9	The Pumping Lemma	11
R 9/11	Using the Pumping Lemma	12
F 9/12	Context-Free Grammars and Languages	19
M 9/15	Context-Free Grammars and Languages	19
T 9/16	Unit- and e-production elimination	21
R 9/18	Chomsky Normal Form	21
F 9/19	Review
M 9/19	Midterm Exam
T 9/22	Pumping Lemma for context-free languages	22
R 9/23	Pushdown Automata	23
F 9/25	Equivalence of PDAs and CFGs	24,25
M 9/26	Parsing and ambiguity	26
T 9/29	Parsing and ambiguity	26
R 9/30	The Cocke-Kasami-Younger Algorithm	27
F 10/2	Turing Machines	28
M 10/6	Turing Machines, recursive and R.E. sets	29
T 10/7	Alternate models of Turing Machines	30
R 10/9	Universal Machines and decidability	31
F 10/10	Undecidability of the Halting Problem	31
M 10/13	Decidable and Undecidable Problems	32
M 10/14	Review
T 10/16	Final Exam