MCS   265:   Theory of Computation
Spring 2006

Homework problems   Reading assignments, part 2
MCS-265 homepage
Homework guidelines
Prof. Barbara Kaiser


Reading assignments, Feb. 6 - March 25

Date:
Section: Topic:
Due:
Feb. 6
  Chapter 0
 Introduction, review of  236 material
 
Feb. 7
 
 Problem day
 
Feb. 9
 1.1
 Finite Automata
 
 Feb. 10  
 Regular languages
 
 
 
 
 
Feb. 13  1.2
 Nondeterminism
 Hw 1 (1.1)
Feb. 14  
 Cont.
 
Feb. 16  
 Problem day

Feb. 17  1.3
 Regular expressions
 
   
 
 
Feb. 20 1.3/1.4
 Non-regular languages
 
Feb. 21  1.4
 Pumping lemma
 Hw 2 (1.2, 1.3)
Feb. 23    cont.  
Feb. 24    Problem day  
 
 
 
 
Feb. 27
2.1  Context-free grammars
Feb. 28
   Chomsky normal form  
March 2

 Problem day  
March 3   2.2   Pushdown automata  Hw 3 (1.3, 1.4)
   
 
 
March 6
 Pushdown automata, cont.
March7     cont.  
March 9  
   
March 10  2.3  Non-context-free languages  Hw 4(2.1,2.2)
 
 
 
 
March 13    Review/catch-up  
March 14  
Test #1  
March 16
 BK gone
 
March 17  3.1  Turing machines  
 
 
 
 
March 20  3.2
 Variants of Turing machines  
March 21    Cont.  Hw 5(3.1, 3.2)
March 23  3.3 Algorithms  
March 24

 Algorithms cont.

 


Last modified: 4/2/6