CS 2120 Theory of Computation 3.0 Credits
This course introduces the formal theory of computation. Topics include formal models of computation including finite and pushdown automata, and Turing machines; abstract specifications of computation including regular expressions and grammars; and basic complexity theory. Theory is grounded with applications and relevance to the design and implementation of computing systems.
Repeat Status: Not repeatable for credit
Prerequisites: (CS 1031 [Min Grade: D] or CS 172 [Min Grade: D]) and (MATH 2402 [Min Grade: D] or MATH 180 [Min Grade: D] or MATH 221 [Min Grade: D])