TENTATIVE SCHEDULE FOR CPT S 317 (Spring 2009)

(subject to change as the course progresses)

Class Day Date Topic Readings (sections)

Assignments*

Due Posting
1 M 1/12 Course introduction, introduction to automata theory Chapter 1    
2 W   Formal proofs      
3 F   Finite Automata (DFA & NFA) Chapter 2    
--- M 1/19 MLK Day (holiday)      
4 W   Equivalence of DFA & NFA, epsilon-transitions     HW1
5 F          
6 M 1/26 Regular expressions Chapter 3    
7 W       HW1 HW2
8 F   Regular language properties: pumping lemma Chapter 4    
9 M 2/2 Closure properties      
10 W       HW2  
11 F   (TA will review HW1 & HW2)      
12 M 2/9 Decision properties of regular languages      
13 W Equivalence & minimization of DFAs HW3
14 F          
--- M 2/16 President's day (holiday)      
15 W   Context free grammars & languages Chapter 5 HW3  
16 F   Midterm I      
17 M 2/23        
18 W   CFGs...      
19 F   PDAs Chapter 6   HW4
20 M 3/2        
21 W   D-PDAs      
22 F       HW4  
23 M 3/9 CFL properties: simplification, normal forms Chapter 7    
24 W         HW5
25 F          
--- M 3/16 Spring Break (no classes)      
--- W        
--- F        
26 M 3/23 Pumping Lemma for CFLs      
27 W       HW5 HW6
28 F          
29 M 3/30        
30 W Closure properties for CFL HW6
31 F Turing machines Chapter 8
32 M 4/6 CFL review (HW 5 & 6 )     HW7
33 W   Midterm II review      
34 F   Midterm II      
35 M 4/13 Turing machines & extensions, RE languages ...      
36 W       HW7  
37 F   Midterm II - make up     HW8
38 M 4/20 Undecidability, diagonalization, problem reduction Chapter 9    
39 W          
40 F       HW8  
41 M 4/27 Intractable problems Chapter 10    
42 W   P & NP, NP-completeness      
43 F   Course & finals review      
--- M 5/4 FINAL EXAM (Monday, 3:10p-5:10p, in class)      
--- W        
--- F        

* Homework links will be activated on their posting dates.