Theory of Automata, Formal Languages, and Computation

3 credits · Graduate School

Also listed as CS 5252. Finite-state machines and regular expressions. Context-free grammars and languages. Pushdown automata. Turing machines. Undecideability. The Chomsky hierarchy. Computational complexity. Serves as repeat credit for CS 5252. No credit for students who have earned credit for CS 3252 or ECE 3452. SPRING. [3]