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 411.
Add to Portfolio (opens a new window)
