CS 273
Theory of Computation

Credit:  3 hours.

This course satisfies the General Education Criteria for a
Quant Reasoning II course.

Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; computability and the halting problem; undecidable problems. Prerequisite: CS 173 or MATH 213; CS 225.