CSC 244 - Theory of Computation

1 semester, 4 credits-

Formal languages and automata theory, with an introduction to computability. Course coverage includes deterministic and nondeterministic automata, pushdown automata, regular and context‐free languages and grammars, models of computation including the Turing machine, computability, decidability, and the Halting problem.

Prerequisites: MTH 117 or MTH 290