CSC 4170
:
Theory of Computation
Finite automata and regular expressions; push down automata and context-free grammars; Turing machines; Church's thesis; computability; NP-completeness.
Prerequisites
CSC 1700 :Y :D-