15453 Formal Languages, Automata, and Computation
Lecture 11: Pushdown Automata and ContextFree Grammars
We complete the proof of the theorem that a language is context
free if and only if it is recognized by a pushdown automaton. This
directions requires that we construct a contextfree grammar to
simulate a pushdown automaton and verify the correctness of
the construction.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
