Department of Biomedical Engineering
Course Info

CS533 Automata and Formal Languages

Assignments  60% 

Midterm  20% 
Final Exam  20% 
The textbook is Introduction to the Theory of Computation 2nd edition, by Michael Sipser.
Tue Jan 8 Class 1  Lecture 1a  Finite Automata  Chapter 1 

Thu Jan 10 Class 2  Lecture 1b  Nondetermistic Finite Automata  
Homework 1  Due Thursday January 17 by 4:00pm.  
Tue Jan 15 Class 3  Lecture 1c  Regular Expressions  
Thu Jan 17 Class 4  Lecture 1d  Pumping Lemma  
Lecture 2a  Context Free Grammars  Chapter 2  
Homework 2  Due Thursday January 24 by 4:00pm.  
Tue Jan 22 Class 5  Lecture 2b  Designing CFG, Chomsky Normal Form,  
Thu Jan 24 Class 6  Continued  Nondeterministic pushdown automata  
Homework 3  Due Thursday January 31 by 4:00pm.  
Tue Jan 29 Class 7  Lecture 2c  Equivalence of PDA and CFG  
Thu Jan 31 Class 8  Lecture 2d  Pumping Lemma  Chapter 3 
Homework 4  Due Thursday February 7 by 4:00pm.  
Tue Feb 5 Class 9  Lecture 3a
Lecture 3b  Turing Machines  
Thu Feb 7 Class 10  Lecture 3c  Variants  
Homework 5  Due Thursday February 14 by 4:00pm.  
Tue Feb 12 Class 11  Lecture 4a  Decidability of DFA's and CFG's  Chapter 4 
Thu Feb 14 Class 12  Lecture 4b  Enumerable sets and the Halting Problem  
Tue Feb 19 Class 13  Midterm Review  
Homework 6  Due Tuesday February 26 by 4:00pm.  
Thu Feb 21 Class 14  Midterm Chapters 13  
Tue Feb 26 Class 15  Lecture 5a  Reductions  Chapter 5 
Thu Feb 28 Class 16  Lecture 5b  Reductions on Computational Histories  
Homework 7  Due Monday March 11 by 4:00pm.  
Tue Mar 5 Class 17  Lecture 7a  Time Complexity  Chapter 7 
Thu Mar 7 Class 18  Lecture 7b  P and NP  
Homework 8  Due Friday March 15 by 4:00pm. Hand it in to Pat Dickerson, who will give you the solutions.  
Tue Mar 12 Class 19  Lecture 7b  P and NP  
Homework 9  Due Tuesday March 19 by 4:00pm. Hand it in to Pat Dickerson, who will give you the solutions.  
Thu Mar 14 Class 20 