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.
Prerequisites: CSC-160 and MAT-252. The
prerequisite courses must be passed with minimum
grades of C.
Prerequisite
CSC-160, and
MAT-252 must be completed with a grade of C orbetter prior to registering for this course.