P: 362. Fall. Introduction to formal languages and automata theory:
finite automata and regular  expressions, context-free grammars and
languages, pushdown automata, equivalence of CFGs and pushdown
automata, application of pushdown automata in parsing, closure
properties, pumping lemmas, decision  procedures, Turing machines,
computability, undecidability, and a brief survey of the Chomsky
hierarchy.