CPS 410 - Algorithms and Formal Language

Credit Hours: 3

Studies formal models of computation such as finite state automata, pushdown automata, and Turing machines, along with the corresponding elements of formal languages. Uses models to provide a mathematical basis for the study of computability. Church’s thesis and the universal Turing machine led to the study of undecidable problems.

Prerequisite: MAT 232