CSC 581 - Theory of Computation

Admission to the MS In CAIS program, CSC 575; or consent of instructor(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 NPGraded ABCDEN/Y