CSCI-3050 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. Formerly CSC-350.