15-453 Formal Languages, Automata, and Computation
Lecture 11: Pushdown Automata and Context-Free 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 context-free grammar to simulate a pushdown automaton and verify the correctness of the construction.

• Reading: Ch. 2.2, pp. 111-114
• Previous lecture: Pushdown Automata
• Next lecture: Non-Context-Free Languages

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning