CSC 542 Theory of Computation

This course will provide students with a detailed examination of the theory of computing. This includes automata and language theory, computability theory, and complexity theory. Students will laern about finite automata, regular expressions, Turing machines, decidability and the halting problem. Additionally, time and space measures, complexity classes, i.e., P, NP, L, NL, etc., and P versus NP will also be covered. Prerequisite: CSC 302 and CSC 295; CSC 501 and CSC 502; or being matriculated in the Computer Science Master's program.

Credits

3