CS 252

Theory of Automata, Formal Languages, and Computation 

Course Schedule

Spring 2008

Date Lecture Topic Reading Special Events
Jan 10 Administrivia, Discrete Math Review, Strings Chapter 0  
Jan 15 Proofs
Languages
Finite State Machines
Chapter 0
Chapter 1.1
 
Jan 17 Designing DFAs
Closure
Chapter 1.1 HW 1 Due
Jan 22 JFLAP
Non-deterministic FAs
Chapter 1.2  
Jan 24 NFA Closure
NFA and DFA equivalence
Chapter 1.2 HW 2 Due
Jan 29 NFA epsilon transition removal
Regular Expressions
Chapter 1.2 - 1.3  
Jan 31 Regular Expressions
Equivalence of Reg Expressions, DFAs and NFAs
Chapter 1.3 HW 3 Due
Feb 5 Non-regular languages
Pumping Lemma
Chapter 1.4  
Feb 7 Exam 1   No HW
Feb 12 Context-free Grammars Chapter 2.1 Extra Example Notes
Feb 14 Chomsky-normal form
Pushdown Automata
Chapter 2.1 - 2.2 HW 4 Due
Feb 19 Pushdown Automata
Converting CFGs to PDAs
Chapter 2.2  
Feb 21 Converting PDAs to CFGs Chapter 2.2 HW 5 Due
Feb 26 Pumping Lemma for CFLs
Closure Properties
Chapter 2.3  
Feb 28 CFL Closure Properties Chapter 2.3 HW 6 Due
March 4 Spring Break    
March 6 Spring Break    
March 11 Turning Machines Chapter 3.1  
March 13 Exam 2   No HW
March 18 Multi-tape TMs Chapter 3.2  
March 20 Non-deterministic TM's Chapter 3.2 HW 7 Due
March 25 Encoding problems
Decidability
Chapter 3.3, 4.1  
March 27 Decidability Chapter 4.1 HW 8 Due
April 1 The Halting Problem Chapter 4.2  
April 3 Reductions for Undecidability Chapter 5.1 HW 9 Due
April 8 Undecidable Problems
Rice's Theorem
Chapter 5.1  
April 10 Post's Correspondence Problem Chapter 5.2 HW 10 Due
April 15 P and NP Problems Chapter 7.1-7.3  
April 17 NP-Completeness Chapter 7.4-7.5 HW 11 Due
April 22 Review    
April 28 Final Exam - 2:00 PM    

 

Key to Reading
Notes Topic specific materials not covered in the texts
Sipser Introduction to the Theory of Computation


Last Updated Dec 24, 2007 by adamsja.