CSC 581 - Theory of Computation

Admission to the MS in CSIS program. (3).

Finite automata theory, including determinism vs. nondeterminism, regular expressions, non-regular languages, and algorithms for finite automata. Context free languages including grammars, parsing, and properties. Turing machines and their functions. Undecidability. Computational complexity, including the classes P and NP. Graded ABCDE/Y. Offered infrequently.