CPS 4501 FORMAL LANG & AUTOMATA THRY
COURSE NO: CPS 4501 SEMESTER HOURS: Three (3) PREREQ: CPS CORE, & MATH 2110 ENROLLMENT LIMIT: Twenty (20) Concentration Requirement for Computer Science Major Formal definitions of various kinds of automata, including the finite automaton, the pushdown automaton, and the Turing Machine. Different types of formal languages and their relationships to automata. The Church-Turing Thesis and the notion of algorithm. Decidability and Solvability. COURSE DESCRIPTION CHANGED AS OF 5/24/10