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. Prerequisite(s): CS 258 and either CS 250 or MTH 311 with a C- or better in all courses.
Grade mode designated on a CRN basis each term. Students should consult current term schedule.