W	L	Date	Topic	Reading	Note
1	1	2012-08-20	Course agenda, policies, sets, languages, proofs
	2	2012-08-22	Finite automata, induction	Chapter 1
2	3	2012-08-27
	4	2012-08-29	Examples of DFAs	Sections 2.1 and 2.2
3		2012-09-03	Labor Day (no lecture)
	5	2012-09-05	DFAs and NFAs	Chapter 2
4	6	2012-09-10
	7	2012-09-12
5	8	2012-09-17	Regular expressions	Chapter 3
	9	2012-09-19
6	10	2012-09-24	Properties of regular sets	Chapter 4
	11	2012-09-26
7	12	2012-10-01
	13	2012-10-03
8		2012-10-08	Midterm 1 (in regular lecture room, open book and notes)
	14	2012-10-10	Decisions problems regarding regular sets	Chapter 4
9	15	2012-10-15	Context Free Languages	Chapter 5
	16	2012-10-17
10	17	2012-10-22
	18	2012-10-24
11	19	2012-10-29	Properties of CFLs	Chapter 7
	20	2012-10-31
12	21	2012-11-05
	22	2012-11-07	Introduction to Turing Machines	Chapter 8
13	23	2012-11-12
		2012-11-14	Midterm 2 (in regular lecture room, open book and notes)
14		2012-11-19	Thanksgiving break
		2012-11-21	Thanksgiving break
15	24	2012-11-26	Undecidability	Chapter 9
	25	2012-11-28
16	26	2012-12-03
	27	2012-12-05	NP-completeness, recap
17		2012-12-12	Final exam (in regular lecture room, open book and notes)

Unless noted otherwise, chapter and section numbers refer to the chapters and sections from the textbook.