CS 154 -- Automata and Complexity Theory -- Winter 2012

[general info]  [lecture notes] [homeworks] [exams]

what's new

general information



Classes are Tuesdays-Thursdays, 9:30-10:45, In NVDIA auditorium, Huang Engineering center

Office hours:

You can ask questions using piazza

References: the textbook is

Grading: the homeworks are worth 50% of the grade, the final 30% and the midterm 20%. We will drop the lowest homework grade in computing the homework grade average.


classes and lecture notes

so far:

the plan:

Lecture notes

  1. Myhill-Nerode theorem and state minimization
  2. Streaming algorithms
  3. Rice's theorem
  4. Logic
  5. Kolmogorov complexity
  6. NP-completeness


Homeworks are out on Thursdays and are due the following Thursday.
  1. Homework 1 is due Jan 19
  2. Homework 2 is due Jan 26
  3. Homework 3 is due Feb 2
  4. Homework 4 is due Feb 9
  5. Homework 5 is due Feb 23
  6. Homework 6 is due Mar 1
  7. Homework 7 is due Mar 8
  8. Homework 8 is due Mar 15


The midterm was in class, on February 14

The final exam will be on Thursday, March 22, from 12:15 to 3:15pm, in the Nvidia Auditorium. You can use one double-sided sheet of notes, and the exam is otherwise closed-book.