Collapsible pushdown graphs of level 2 are tree-automatic

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 501-512

  Kartzow, Alexander ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Collapsible pushdown graphs; Collapsible pushdown systems; First order decidability; Reachability; Tree automatic structures

Indexed keywords

FIRST-ORDER; LEVEL 2; PUSHDOWN GRAPHS; PUSHDOWN SYSTEMS; REACHABILITY; SECOND LEVEL;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; FORESTRY;

TREES (MATHEMATICS);

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

References (12)

1. R. Alur, S. Chaudhuri, and P. Madhusudan. Languages of nested trees. In Proc. 18th International Conference on Computer-Aided Verification, volume 4144 of LNCS, pages 329-342. Springer, 2006.
2. A. Blumensath. Automatic structures. Diploma thesis, RWTH Aachen, 1999.
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. D. Caucal. On infinite terms having a decidable monadic theory. In MFCS'02, pages 165-176, 2002.
5. J. Doner. Tree acceptors and some of their applications. J. Comput. Syst. Sci., 4(5):406-451, 1970.
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. A. Kartzow. FO model checking on nested pushdown trees. In MFCS'09, volume 5734 of LNCS, pages 451-463. Springer, 2009.
8. 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.
9. D. Kuske. Theories of automatic structures and their complexity. In CAI'09, Third International Conference on Algebraic Informatics, volume 5725 of LNCS, pages 81-98. Springer, 2009.
10. A. N. Maslov. The hierarchy of indexed languages of an arbitrary level. Sov. Math., Dokl., 15:1170-1174, 1974.
11. A. N. Maslov. Multilevel stack automata. Problems of Information Transmission, 12:38-43, 1976.
12. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.