TENTATIVE SCHEDULE FOR CPT S 317 (Spring 2011)Schedule subject to change as the course progresses

* Homework links will be activated on their posting dates.

Class Day Date Topic Readings (sections)

Assignments*

Due Posting
1 M 1/10 Course introduction, introduction to automata theory Chapter 1    
2 W   Introduction to the Gradiance tool, Formal proofs      
3 F          
--- M 1/17 MLK Day (holiday)      
4 W   Finite Automata (DFA & NFA) Chapter 2   HW1
5 F   Equivalence of DFA & NFA, epsilon-transitions      
6 M 1/24 Regular expressions Chapter 3    
7 W       HW1  
8 F   Regular language properties: pumping lemma Chapter 4   HW2
9 M 1/31 Closure properties      
10 W          
11 F       HW2  
12 M 2/7 Decision properties of regular languages     HW3
13 W Equivalence & minimization of DFAs
14 F          
--- M 2/14     HW3  
15 W   Context free grammars & languages Chapter 5    
16 F  

Midterm I

     
17 M 2/21 President's day (holiday)      
18 W   CFGs...      
19 F   PDAs Chapter 6    
20 M 2/28        
21 W   D-PDAs     HW4
22 F          
23 M 3/7 CFL properties: simplification, normal forms Chapter 7    
24 W       HW4  
25 F         HW5
--- M 3/14 Spring Break (no classes)      
--- W        
--- F        
26 M 3/21 Pumping Lemma for CFLs      
27 W          
28 F       HW5 HW6
29 M 3/28        
30 W Closure properties for CFL
31 F Chapter 8 HW6 HW7
32 M 4/4 Turing machines      
33 W   CFL review (HW 4, 5 & 6 )      
34 F   Midterm II review   HW7  
35 M 4/11        
36 W  

Midterm II

     
37 F   No class - instructor travel      
38 M 4/18 Turing machines & extensions, RE languages ... Chapter 9    
39 W   Undecidability, diagonalization, problem reduction     HW8
40 F          
41 M 4/25 Intractable problems Chapter 10    
42 W   P & NP, NP-completeness   HW8  
43 F   Course & finals review      
--- M 5/2

FINAL EXAM: TUESDAY 8:00-10:00AM

     
--- W        
--- F