Theory of Automata, Formal Languages, and Computation

3 credits · Undergraduate

Also listed as ECE 3452. 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 ECE 3452. No credit for students who have earned credit for CS 5252 or ECE 5452. Prerequisite: CS 2212. SPRING. [3]