CSC-350 Formal Languages and Automata
An introduction to the theoretical foundations of computing. Topics may include finite-state automata, regular languages, context-free languages, Turing machines, decidability and halting, Gödel's incompleteness theorems, and the complexity hierarchy of algorithms.
Prerequisite
CSC-160 or
MAT-252 must be completed with a grade of C or better prior to taking this course.