@inproceedings{parys:LIPIcs:2012:3394,
Address = {Dagstuhl, Germany},
Annote = {Keywords: pushdown graph, epsilon-contraction, pumping lemma},
Author = {Parys, Pawel},
BookTitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
Editor = {D{\"u}rr, Christoph and Wilke, Thomas},
File = {A Pumping Lemma for Pushdown Graphs of Any Level - Parys (0) (0) - a - a - f.pdf},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
Keywords = {higher-order pushdown automata and higher-order recursion schemes},
Pages = {54--65},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{A Pumping Lemma for Pushdown Graphs of Any Level}},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3394},
Volume = {14},
Year = {2012},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2012/3394},
bdsk-url-2 = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.54},
date-added = {2012-06-05 11:15:02 +0200},
date-modified = {2012-06-05 09:15:13 +0000},
urn = {urn:nbn:de:0030-drops-33940},
doi = {10.4230/LIPIcs.STACS.2012.54}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A