Collapse operation increases expressive power of deterministic higher order pushdown automata

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 603-614

  Parys, Paweł ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWER; PUSH-DOWN AUTOMATA; RECURSION SCHEMES; SAFE RECURSION; SECOND LEVEL;

COMPUTER SCIENCE;

EID: 84865012791     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.603     Document Type: Conference Paper

References (11)

1. Klaus Aehlig, Jolie G. de Miranda, and C.-H. Luke Ong. The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable. In TLCA, pages 39-54, 2005.
2. Klaus Aehlig, Jolie G. de Miranda, and C.-H. Luke Ong. Safety is not a restriction at level 2 for string languages. In FoSSaCS, pages 490-504, 2005.
3. Didier Caucal. On infinite terms having a decidable monadic theory. In MFCS, pages 165-176, 2002.
4. Bruno Courcelle. The monadic second-order logic of graphs ix: machines and their behaviours. Theor. Comput. Sci., 151(1):125-162, 1995.
5. Bruno Courcelle and Teodor Knapik. The evaluation of first-order substitution is monadic second-order compatible. Theor. Comput. Sci., 281(1-2):177-206, 2002.
6. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In LICS '08, pages 452-461, Washington, DC, USA, 2008. IEEE Computer Society.
7. Teodor Knapik, Damian Niwinski, and Pawel Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS '02, pages 205-222, London, UK, 2002. Springer-Verlag.
8. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, and Igor Walukiewicz. Unsafe grammars and panic automata. In ICALP, pages 1450-1461, 2005.
9. Naoki Kobayashi. Model-checking higher-order functions. In PPDP '09: Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, pages 25-36, New York, NY, USA, 2009. ACM.
10. A. N. Maslov. The hierarchy of indexed languages of an arbitrary level. Soviet Math. Dokl., 15:1170-1174, 1974.
11. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In LICS '06, pages 81-90, Washington, DC, USA, 2006. IEEE Computer Society.