Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
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. Note: This course assumes that students have the equivalent of an undergraduate-level course in abstract algebra (e.g., MATH 4140). Cross-listed with CSCI 5446.
Units: 3.0
Hours: 3 to 3