Document Open Access Logo

A Pumping Lemma for Pushdown Graphs of Any Level

Author Pawel Parys

Thumbnail PDF


  • Filesize: 0.56 MB
  • 12 pages

Document Identifiers

Author Details

Pawel Parys

Cite AsGet BibTex

Pawel Parys. A Pumping Lemma for Pushdown Graphs of Any Level. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 54-65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)


We present a pumping lemma for the class of epsilon-contractions of pushdown graphs of level n, for each n. A pumping lemma was proposed by Blumensath, but there is an irrecoverable error in his proof; we present a new proof. Our pumping lemma also improves the bounds given in the invalid paper of Blumensath.
  • pushdown graph
  • epsilon-contraction
  • pumping lemma


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail