Collapsible pushdown automata and recursion schemes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2008, Pages 452-461

  Hague, M ^a   Murawski, A S ^b   Ong, C H L ^b   Serre, O ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b OUCL ^*

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC IN COMPUTER SCIENCE; PUSHDOWN AUTOMATA;

COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTERS;

AUTOMATA THEORY;

EID: 51549119988     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2008.34     Document Type: Conference Paper

References (24)

1. K. Aehlig, J. G. de Miranda, and C.-H. L. Ong. Safety is not a restriction at level 2 for string languages. In Proc. FOS-SACS'05, LNCS 3411, 2005, pp. 490-501.
2. A. Aho. Indexed grammars - an extension of context-free grammars. J. ACM 15:647-671, 1968.
3. R. Alur and P. Madhusudan. Languages of nested trees. In Proc. CAV'06, 2006.
4. W. Blum. A tool for constructing structures generated by higher-order recursion schemes and collapsible pushdown automata. web.comlab.ox.ac.uk/oucl/ work/william.blum/, 2007.
5. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games. In Proc. ICALP'03, LNCS 2719, pp. 556-569, 2003.
6. D. Caucal. On infinite terms having a decidable monadic theory. In Proc. MFCS'02, LNCS 2420, pp. 165-176, 2002.
7. D. Caucal and S. Hassen. Higher-order recursive schemes. Private communication, 28 pages, July 2006.
8. B. Courcelle. The monadic second-order logic of graphs IX: machines and their behaviours. TCS 151:125-162, 1995.
9. W. Damm. The IO-and OI-hierarchy. TCS 20:95-207, 1982.
10. W. Damm and A. Goerdt. An automata-theoretical characterization of the OI-hierarchy. Info. & Control 71:1-32, 1986.
11. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS'91, pp. 368-377, 1991.
12. J. Engelfriet. Interated stack automata and complexity classes. Info. & Comp. 95:21-75, 1991.
13. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. 2007. 56 pages, downloadable from users.comlab.ox.ac.uk/luke.ong/publications/cpda-long.pdf.
14. J. M. E. Hyland and C.-H. L. Ong. On Full Abstraction for PCF: I. Models, observables and the full abstraction problem, II. Dialogue games and innocent strategies, III. A fully abstract and universal game model. Info. & Comp. 163:285-408, 2000.
15. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In Proc. TLCA'01, LNCS 2044, pp. 253-267, 2001.
16. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-order pushdown trees are easy. In Proc. FOSSACS'02, LNCS 2303, pp. 205-222, 2002.
17. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In Proc. ICALP'05, LNCS 3580, pp. 1450-1461, 2005.
18. A. N. Maslov. Multilevel stack automata. Problems of Information Transmission, 12:38-43, 1976.
19. C.-H. L. Ong. On model-checking trees generated by higherorder recursion schemes. In Proc. LICS'06, pp. 81-90, 2006.
20. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. AMS 141:1-35, 1969.
21. W. Thomas. On the synthesis of strategies in infinite games. In Proc. STACS'95, LNCS 900, pp. 1-13, 1995.
22. I. Walukiewicz. Pushdown processes: games and modelchecking. Info. & Comp. 157:234-263, 2001.
23. I. Walukiewicz. A landscape with games in the backgroung. In Proc. LICS'04, pp. 356-366, 2004.
24. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS 200(1-2):135-183, 1998.