CS 518 - Theory of Computation

4 credits
Covers formal language and automata theory from finite state automata to Turing machines. Presents the Chomsky hierarchy of languages and the relationship between languages and automata. Prerequisite(s): CS 258 and MTH 252 with a C- or better or appropriate SOU placement level.
Graded (A-F) only.