You have reached the homepage for the Northeastern University, College of Computer and Information Science, Fall 2003 session of Theory of Computation, also known as "CSU390 03F." 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.