The Pumping Lemma for Context-Free Languages is Undecidable.

Hermann Gruber, Markus Holzer, Christian Rauch

Browse the full DLT paper archive.