15-453 Formal Languages, Automata, and Computation
Lecture 13: Review

In preparation for the midterm examination, we review the basic models of computation and classes of languages we have seen so far. We also recapitulate basic proof techniques and heuristics for designing grammars, automata, or showing that they do not exist.

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning