CSC 381 Theory of Computation
A study of theoretical models of computing, including finite state machines, pushdown automata, context-free grammars, and Turing machines. The concepts of decidability, complexity theory, and NP- Completeness will be studied in depth. (3 credit hours)
Offered
Fall, Spring