CSCI 435 Formal Languages and Automata
A study of automata, grammars, and Turing machines as specifications for formal languages. Computation is defined in terms of deciding properties of formal languages, and the fundamental results of computability and decidability are derived.
Prerequisite
Prerequisite: CSCI 365 with a grade of C or better