CSCI 8850
Advanced Automata and Formal Languages

A continuation of MATH/CSCI 4660/8666. The course will be an introduction to Computational Complexity. Topics that will be covered include space and time complexities of Turing Machines, deterministic versus non-deterministic machines, NP-Complete problems, alternating Turing machines, and concepts of reducibility. Not open to nondegree students.

Credit

3 semester hours

Cross-listed as

MATH-8850, MATH-4760, MATH-8766, MATH-8306