CSCI 5446 - Theory of Automata

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. Restriction: Restricted to students with graduate standing. Note: Expected knowledge of algorithms equivalent to CSCI 3412.Cross-listed with MATH 5446. Max hours: 3 Credits. Semester Hours: 3 to 3