Tentative Reading and Test Schedule
Keep in mind, this page is a work in progress. It was last updated on 1/28/15.
Week  Dates  Monday  Tuesday  Thursday  Friday 

1  2/92/13  Review Chapter 0 
Problem day  BK out  Finite automata 1.1 
2  2/162/20  Regular languages 1.1 
Cont.  Nondeterminism 1.2 
Cont. 
3  2/232/27  Problem day  Regular expressions 1.3 
Nonregular languages 1.3, 1.4 
Cont. 
4  3/23/6  Pumping lemma 1.4 
Cont.  Contextfree grammars 2.1 
Chomsky normal form 2.1 
5  3/93/13  Pushdown automata 2.2 
Cont.  Equivalence of PDA and CFL  Cont. 
6  3/163/20  Problem day  Pumping lemma for CFL's  Noncontextfree languages 2.3 
Review, catch up 
7  3/233/27  Review  Test #1  Turing machines 3.1 
Cont. 
8  3/304/3  Spring break; no class  Spring break; no class  Spring break; no class  Spring break; no class 
9  4/64/10  Spring break; no class  Turing machines 3.1 
Cont.  Cont. 
10  4/134/17  Variants of Turing machines 3.2  Cont.  Decidable languages 4.1 

11  4/204/26  Decidable languages 4.1 
Cont.  Halting problem 4.2 
Undecidable problems 5.1 
12  4/275/1  5.1 cont.  Mapping reducible 5.3 
Review/catch up  Test #2 
13  5/45/8  Complexity theory 7.1 
Cont.  The class P 7.2 
Cont. 
14  5/115/15  The class NP 7.3 
Continued  Polynomial time reducibility  NPcompleteness 7.4 
15  5/185/22  Cont.  Review 
Final: Tuesday, May 26, 1:00 3:00pm