Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection

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

Volumn , Issue , 2012, Pages 165-174

  Carayol, Arnaud ^a   Serre, Olivier ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Collapsible Pushdown Automata; MSO Effective Selection; Recursion Schemes; Safety Constraint

Indexed keywords

GAME SEMANTICS; MSO EFFECTIVE SELECTION; PUSH-DOWN AUTOMATA; RECURSION SCHEMES; REWRITING SYSTEMS; SAFETY CONSTRAINT;

COMPUTABILITY AND DECIDABILITY; SEMANTICS;

COMPUTATION THEORY;

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

References (18)

1. C. Broadbent. On Collapsible Pushdown Automata, their Graphs and the Power of Links. PhD thesis, University of Oxford, Forthcoming.
2. C. Broadbent, A. Carayol, C.-H. L. Ong, and O. Serre. Recursion schemes and logical reflexion. In Proc. of LICS'10, pages 120-129. IEEE, 2010.
3. A. Carayol. Automates infinis, logiques et langages. PhD thesis, Université de Rennes 1, 2006.
4. A. Carayol, C. Löding, D. Niwiński, and I. Walukiewicz. Choice functions and well-orderings over the infinite binary tree. Central European Journal of Mathematics, 8(4):662-682, 2010.
5. A. Carayol and M. Slaats. Positional strategies for higher-order pushdown parity games. In Proc. of MFCS'08, volume 5162 of LNCS, pages 217-228. Springer, 2008.
6. W. Damm. The IO- and OI-hierarchies. Theoret. Comput. Sci., 20:95-207, 1982.
7. J. de Miranda. Structures generated by higher-order grammars and the safety constraint. PhD thesis, University of Oxford, 2006.
8. S. Fratani. Automates à piles de piles . . . de piles. PhD thesis, Université de Bordeaux, 2006.
9. M. Hague, A. S. Murawski, C.-H. L. Ong, and O. Serre. Collapsible pushdown automata and recursion schemes. In Proc. of LICS'08, pages 452-461. IEEE, 2008.
10. T. Knapik, D. Niwiński, and P. Urzyczyn. Deciding monadic theories of hyperalgebraic trees. In Proc. of TLCA'01, volume 2044 of LNCS, pages 253-267. Springer, 2001.
11. T. Knapik, D. Niwiński, and P. Urzyczyn. Higher-Order Pushdown Trees Are Easy. In Proc. of FoSSaCS'02, volume 2303 of LNCS, pages 205-222. Springer, 2002.
12. T. Knapik, D. Niwiński, P. Urzyczyn, and I. Walukiewicz. Unsafe grammars and panic automata. In Proc. of ICALP'05, volume 3580 of LNCS, pages 1450-1461. Springer, 2005.
13. N. Kobayashi and C.-H. L. Ong. A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In Proc. of LICS'09, pages 179-188. IEEE, 2009.
14. J.-L. Krivine. A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, 20(3):199-207, 2007.
15. C.-H. L. Ong. On model-checking trees generated by higher-order recursion schemes. In Proc. of LICS'06, pages 81-90. IEEE, 2006.
16. P. Parys. On the Significance of the Collapse Operation. In Proc. of LiCS'12. IEEE, 2012.
17. A. Rabinovich and A. Shomrat. Selection and uniformization problems in the monadic theory of ordinals: A survey. In Pillars of Computer Science, volume 4800 of LNCS, pages 571-588. Springer, 2008.
18. S. Salvati and I. Walukiewicz. Krivine machines and higher-order schemes. In Proc. of ICALP'11, volume 6756 of LNCS, pages 162-173. Springer, 2011.