MATH 3250 Theory of Computation

MATH 3250 Theory of Computation
Theory of Computation
Introduction to the theory of computation: Formal languages, finite automata and regular languages, deterministic and nondeterministic computation, context free grammars, languages, pushdown automata, turning machines, undecidable problems, recursion theorem, computational complexity and NP-completeness.
Pre-requistites: MATH 2170 or equivalent.
credit hours: 3