CSC-350 Formal Languages and Automata
An introduction to the theoretical foundations of
computing, including the theory of formal
languages, decidability, recursion, and
complexity. Topics may include finite-state
automata, regular languages, context-free
grammars, decidability and halting, Turing
machines, and the complexity hierarchy of
algorithms.
Prerequisite
CSC-160 and
MAT-252 must be completed with a minimum grade of C prior to registering for this course.