Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
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. Cross-listed with MATH 5446.
Units: 3.0
Hours: 3 to 3