CS 418 - 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. Grading option designated on a CRN basis each term. Students should consult current term schedule. Restricted to Juniors and above. Prerequisite(s): CS 257 .