CSE 322, Winter 2002
Class Calendar

Here is an approximate schedule of the lectures and exams this quarter.  All subject matter and their dates may be changed at any time.  More details may appear as the time of the lecture gets closer.

Week 1 (April 1 - 5)
 
Overview
  Finite automata, definitions

Week 2 (April 8 - 12)
 
Nondeterminism, subset construction

Week 3 (April 15 - 19)
  Closure properties
  Regular expressions

Week 4 (April 22 - 26)
  Equivalence of models
  Existence of non-regular languages

Week 5 (April 29 - May 3)
  Midterm 1
  Context-free grammars

Week 6 (May 6 - 10)
  Pushdown automata

Week 7 (May 13 - 17)
  Equivalence of models

Week 8 (May 20 - 24)
  Midterm 2
  Chomsky normal form

Week 9 (May 27 - 31)
 
Monday: Memorial Day Holiday
  Existence of non-context-free languages
  Turing machines

Week 10 (June 3 - 7)
  Variants of Turing machines
 
Church-Turing thesis

Finals Week
  Final exam: Monday, June 10, 8:30-10:20am.  045 EE1 (same as lecture).