Abstract
We present a pumping lemma for the class of collapsible pushdown graphs of level 2. This pumping lemma even applies to epsilon-contractions of level 2 collapsible pushdown graphs. Our pumping lemma also improves the bounds of Hayashi's pumping lemma for indexed languages.
BibTeX - Entry
@InProceedings{kartzow:LIPIcs:2011:3240,
author = {Alexander Kartzow},
title = {{A Pumping Lemma for Collapsible Pushdown Graphs of Level 2}},
booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
pages = {322--336},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-32-3},
ISSN = {1868-8969},
year = {2011},
volume = {12},
editor = {Marc Bezem},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3240},
URN = {urn:nbn:de:0030-drops-32406},
doi = {10.4230/LIPIcs.CSL.2011.322},
annote = {Keywords: collapsible pushdown graph, epsilon-contraction, pumping lemma}
}
Keywords: |
|
collapsible pushdown graph, epsilon-contraction, pumping lemma |
Collection: |
|
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL |
Issue Date: |
|
2011 |
Date of publication: |
|
31.08.2011 |