Syllabus for CIT596 Spring 2010
CIT 596 - THEORY OF COMPUTATION - Prerequisite: CIT 592 or equivalent. Relations. Finite automata, regular languages, regular grammars, and applications. Pushdown automata, trees, context-free grammars, and applications. Turing machines. Introduction to computability and complexity theory.
I do not intend to update this page any time soon, as my students are using my materials on Blackboard currently. However, the course as I am currently teaching it is not significantly different from this syllabus, so I am leaving this website intact for interested prospective students and other curious visitors.