On the significance of the collapse operation

Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Volumn , Issue , 2012, Pages 521-530

  Parys, Paweł ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

collapse; Higher order pushdown systems; higher order recursion schemes

Indexed keywords

COLLAPSE; PUMPING LEMMA; PUSH-DOWN AUTOMATA; PUSHDOWN SYSTEMS; RECURSION SCHEMES; SECOND LEVEL; SIDE EFFECT;

COMPUTER SCIENCE;

AUTOMATA THEORY;

EID: 84867163410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2012.62     Document Type: Conference Paper

References (17)

1. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong, "Safety is not a restriction at level 2 for string languages," in FoSSaCS, ser. Lecture Notes in Computer Science, V. Sassone, Ed., vol. 3441. Springer, 2005, pp. 490-504.
2. A. Carayol and S. Wöhrle, "The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata," in FSTTCS, ser. Lecture Notes in Computer Science, P. K. Pandya and J. Radhakrishnan, Eds., vol. 2914. Springer, 2003, pp. 112-123.
3. D. Caucal, "On infinite terms having a decidable monadic theory," in MFCS, ser. Lecture Notes in Computer Science, K. Diks and W. Rytter, Eds., vol. 2420. Springer, 2002, pp. 165-176.
4. R. H. Gilman, "A shrinking lemma for indexed languages," Theor. Comput. Sci., vol. 163, no. 1&2, pp. 277-281, 1996.
5. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre, "Collapsible pushdown automata and recursion schemes," in LICS. IEEE Computer Society, 2008, pp. 452-461.
6. T. Hayashi, "On derivation trees of indexed grammars," Publ. RIMS, Kyoto Univ., vol. 9, pp. 61-92, 1973.
7. A. Kartzow, "Collapsible pushdown graphs of level 2 are tree-automatic," in STACS, ser. LIPIcs, J.-Y. Marion and T. Schwentick, Eds., vol. 5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010, pp. 501-512.
8. -, "A pumping lemma for collapsible pushdown graphs of level 2," in CSL, ser. LIPIcs, M. Bezem, Ed., vol. 12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 322-336.
9. A. Kartzow and P. Parys, "Strictness of the collapsible pushdown hierarchy," CoRR, vol. abs/1201.3250, 2012.
10. T. Knapik, D. Niwinski, and P. Urzyczyn, "Higher-order pushdown trees are easy," in FoSSaCS, ser. Lecture Notes in Computer Science, M. Nielsen and U. Engberg, Eds., vol. 2303. Springer, 2002, pp. 205-222.
11. T. Knapik, D. Niwinski, P. Urzyczyn, and I. Walukiewicz, "Unsafe grammars and panic automata," in ICALP, ser. Lecture Notes in Computer Science, L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, Eds., vol. 3580. Springer, 2005, pp. 1450-1461.
12. N. Kobayashi, "Model-checking higher-order functions," in PPDP, A. Porto and F. J. López-Fraguas, Eds. ACM, 2009, pp. 25-36.
13. A. N. Maslov, "The hierarchy of indexed languages of an arbitrary level," Soviet Math. Dokl., vol. 15, pp. 1170-1174, 1974.
14. A. N. Maslov, "Multilevel stack automata," Problems of Information Transmission, vol. 12, pp. 38-43, 1976.
15. C.-H. L. Ong, "On model-checking trees generated by higher-order recursion schemes," in LICS. IEEE Computer Society, 2006, pp. 81-90.
16. P. Parys, "Collapse operation increases expressive power of deterministic higher order pushdown automata," in STACS, ser. LIPIcs, T. Schwentick and C. Dürr, Eds., vol. 9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011, pp. 603-614.
17. P. Parys, "A pumping lemma for pushdown graphs of any level," 2011, accepted to STACS 2012.