Hours: 3 classroom + 0 lab/studio Prerequisite(s):Regular admission to MSCS program. Taught:Fall only Regular and context-free grammars; Turing machines; recursive and recursively enumerable languages; uncomputability; the Chomsky hierarchy; complexity classes such as P, NP, and NP-complete. ♦
Add to Portfolio (opens a new window)