CSCI 4660 AUTOMATA, COMPUTABILITY, AND FORMAL LANGUAGES (3 credits)
This course presents a sampling of several important areas of theoretical computer science. Definition of formal models of computation, and important properties of such models, including finite automata and Turing machines. Definition and important properties of formal grammars and their languages. Introduction to the formal theories of computability and complexity. (Cross-listed with CSCI 8666, MATH 4660, MATH 8666).
Prerequisite(s): MATH 2030. Recommended: CSCI 3320/CSCI 8325.