COSC 39 Theory of Computation
This course serves as an introduction to formal models of languages and computation. Topics covered include finite automata, regular languages, context-free languages, pushdown automata, Turing machines, computability, and NP-completeness.
Instructor
Chakrabarti
Prerequisite
COSC 30 and/or
COSC 31. Students who have not taken
COSC 30 and/or 31, but have a strong mathematical background, may take COSC 39 with the instructor's permission.