Computer Science | Automata and Formal Languages (3 cr.)
582 | --


P: 470. Spring. Finite automata, regular expressions; push-down
automata, context-free grammars; languages  and behaviors. Closure
properties, pumping lemmas, decision procedures. Deterministic
context-free  languages and LR(k) parsing; brief survey of the Chomsky
hierarchy.