MATH 5446 - Theory of Automata

Infrequent. Studies the relationships between classes of formal languages (regular, context-free, context-sensitive, phrase-structure) and classes of automata (finite-state, pushdown, Turing machines). Additional topics include decidability and computability issues. Prereq: MATH 3000 and 3140. Cross-listed with CSCI 5446. Semester Hours: 3 to 3