Computer Science & Electrical Engineering
Course Info

CS533 Automata and Formal Languages

Assignments  60% 

Midterm  20% 
Final Exam  20% 
The textbook is Introduction to the Theory of Computation 3rd edition, by Michael Sipser.
Mon Sep 25  No class due to OHSU Orientation  

Finite Automata  
Wed Sep 27 Class 1  Lecture 1a  Chapter 1: Finite Automata  Homework 1 
Mon Oct 2 Class 2  Lecture 1b  Proof techniques  
Wed Oct 4 Class 3  Lecture 1c  Nondetermistic Finite Automata  Homework 2 
Mon Oct 9 Class 4  Lecture 1d  Regular Expressions  
Wed Oct 11 Class 5  Lecture 1e
Lecture 1f  Pumping Lemma for nonRegular Languages  Homework 3 
PushDown Automata  
Mon Oct 16 Class 6  Lecture 2a  Chapter 2: Context Free Grammars  
Wed Oct 18 Class 7  Lecture 2b  Designing CFG, Chomsky Normal Form, Nondeterministic pushdown automata  Homework 4 
Mon Oct 23 Class 8  Lecture 2c  Equivalence of PDA and CFG  
Wed Oct 25 Class 9  Continued  Homework 5  
Mon Oct 30 Class 10  Lecture 2d  Pumping Lemma for nonContextFree Languages  
Turing Machines  
Wed Nov 1 Class 11  Lecture 3a  Chapter 3: Turing Machines  Homework 6 
Mon Nov 6 Class 12  Lecture 3b  Nondeterminism  
Wed Nov 8 Class 13  Midterm Review. Sample midterm. Answers.  
Mon Nov 13 Class 14  Midterm Chapters 13  
Wed Nov 15 Class 15  Lecture 4a  Chapter 4: Decidability of DFA's and CFG's  Homework 7 
Mon Nov 20 Class 16  Lecture 4b Lecture 5a  Enumerable sets and the Halting Problem Chapter 5: Reductions  
Wed Nov 22 Class 17  Lecture 5b  Reductions on Computational Histories  Homework 8 
Mon Nov 27 Class 18  Lecture 7a  Chapter 7: Time Complexity  
Wed Nov 29 Class 19  Lecture 7b  P and NP  Homework 9 
Mon Dec 4 Class 20  Lecture 7c  NP Complete  
Wed Dec 6 Class 21  Continuation  Homework 10  
Mon Dec 11 Class 22  Review Session  
Wed Dec 13 Class 23  Final 