15453 Formal Languages, Automata, and Computation
Lecture 12: NonContextFree Languages
We introduce a version of the pumping lemma for contextfree languages which
allows us to show that various languages are not context
free. Because of the added expressive power of pushdown automata as compared
to finite automata, the pumping lemma and its application are more
complicated. As we will see later in this class, even more powerful models
such as Turing machine require an entirely new technique for showing that they
cannot recognize certain languages.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
