You have reached the homepage for the Northeastern University, College of Computer and Information Science, Spring 2009 session of Theory of Computation, also known as "CSU390 09S." CSU390 is an undergraduate course on the theory of computation. This course serves as an introduction to formal models of languages and computation. Topics covered include finite automata and regular languages, pushdown automata and context-free languages, Turing machines, computability, and NP-completeness.
This document, and all documents on this website, may be modified from time to time; be sure to reload documents on occasion and check the "last modified" date against any printed version you may have.
April 16: The exam is tomorrow: Friday, April 17 8:00am-10:00am, in RB409. The exam will be open book, open notes. The only computational devices permitted is one brain per student.
March 10: Homework 7 is up.
March 8: Don't forget: the midterm is Tuesday March 10, in class. It will be closed notes / closed book.
March 8: A buggy PDF for homework 5 was uploaded to the web page. The correct, finished version of that homework has been re-uploaded, and the deadline extended to Thursday 6:00 PM.
Make sure your browser has refreshed the downloaded pdf file — if the title of the homework doesn't say "Homework 5 (corrected)," you still have the old one.