A pumping lemma for collapsible pushdown graphs of level 2

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 12, Issue , 2011, Pages 322-336

  Kartzow, Alexander ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

contraction; Collapsible pushdown graph; Pumping lemma

Indexed keywords

INDEXED LANGUAGES; LEVEL 2; PUMPING LEMMA; PUSHDOWN GRAPHS;

COMPUTATION THEORY;

PUMPS;

EID: 84865000509     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.CSL.2011.322     Document Type: Conference Paper

References (13)

1. A. Blumensath. On the structure of graphs in the Caucal hierarchy. Theoretical Computer Science, 400:19-45, 2008.
2. C. H. Broadbent. Private communication. September 2010.
3. A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, volume 2914 of LNCS, pages 112-123. Springer, 2003.
4. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007. release October, 12th 2007.
5. Robert H. Gilman. A shrinking lemma for indexed languages. Theor. Comput. Sci., 163(1&2):277-281, 1996.
6. M. Hague, A. S. Murawski, C-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In LICS '08: Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pages 452-461, 2008.
7. Takeshi Hayashi. On derivation trees of indexed grammars. Publ. RIMS, Kyoto Univ., 9:61-92, 1973.
8. A. Kartzow. Collapsible pushdown graphs of level 2 are tree-automatic. In STACS 10, volume 5 of LIPIcs, pages 501-512. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2010.
9. A. Kartzow. First-Order Model Checking On Generalisations of Pushdown Graphs. PhD thesis, Technische Universität Darmstadt, 2011. Unpublished, submitted in December 2010.
10. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FOSSACS'02, volume 2303 of LNCS, pages 205-222. Springer, 2002.
11. Naoki Kobayashi. Types and higher-order recursion schemes for verification of higher-order programs. SIGPLAN Not., 44:416-428, January 2009.
12. Pawel Parys. The pumping lemma is incorrect? unpublished, June 2010.
13. Pawel Parys. Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. In Thomas Schwentick and Christoph Dürr, editors, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), volume 9 of Leibniz International Proceedings in Informatics (LIPIcs), pages 603-614, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.