C. Broadbent, On Collapsible Pushdown Automata, their Graphs and the Power of Links

C. Broadbent, A. Carayol, C. L. Ong, and O. Serre, Recursion schemes and logical reflexion, Proc. of LICS'10, pp.120-129, 2010.
DOI : 10.1109/lics.2010.40
URL : https://hal.archives-ouvertes.fr/hal-00479818/file/main.pdf

A. Carayol, C. Löding, D. Niwi´nskiniwi´nski, and I. Walukiewicz, Abstract, Open Mathematics, vol.8, issue.4, pp.662-682, 2010.
DOI : 10.2478/s11533-010-0046-z

A. Carayol and M. Slaats, Positional strategies for higherorder pushdown parity games, Proc. of MFCS'08, pp.217-228, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00620254

W. Damm, The IO- and OI-hierarchies, Theoretical Computer Science, vol.20, issue.2, pp.95-207, 1982.
DOI : 10.1016/0304-3975(82)90009-3

J. Miranda, Structures generated by higher-order grammars and the safety constraint, 2006.

S. Fratani, Automates à piles de piles . . . de piles, 2006.

M. Hague, A. S. Murawski, C. L. Ong, and O. Serre, Collapsible Pushdown Automata and Recursion Schemes, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.452-461, 2008.
DOI : 10.1109/LICS.2008.34
URL : https://hal.archives-ouvertes.fr/hal-00345945

T. Knapik, D. Niwi´nskiniwi´nski, and P. Urzyczyn, Deciding Monadic Theories of Hyperalgebraic Trees, Proc. of TLCA'01, pp.253-267, 2001.
DOI : 10.1007/3-540-45413-6_21

T. Knapik, D. Niwi´nskiniwi´nski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, Proc. of FoSSaCS'02, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15

T. Knapik, D. Niwi´nskiniwi´nski, P. Urzyczyn, and I. Walukiewicz, Unsafe Grammars and Panic Automata, Proc. of ICALP'05, pp.1450-1461, 2005.
DOI : 10.1007/11523468_117
URL : https://hal.archives-ouvertes.fr/hal-00335729

N. Kobayashi and C. L. Ong, A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.179-188, 2009.
DOI : 10.1109/LICS.2009.29

J. Krivine, A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation, pp.199-207, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00154508

C. L. Ong, On model-checking trees generated by higherorder recursion schemes, Proc. of LICS'06, pp.81-90, 2006.

P. Parys, On the Significance of the Collapse Operation, 2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012.
DOI : 10.1109/LICS.2012.62

A. Rabinovich and A. Shomrat, Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey, Pillars of Computer Science, pp.571-588, 2008.
DOI : 10.1007/978-3-540-78127-1_31

S. Salvati and I. Walukiewicz, Krivine machines and higherorder schemes, Proc. of ICALP'11, pp.162-173, 2011.
DOI : 10.1007/978-3-642-22012-8_12
URL : https://hal.archives-ouvertes.fr/hal-01121744

A. Cachat and I. Walukiewicz, The complexity of games on higher order pushdown automata, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00144226

B. Courcelle, A representation of trees by languages I, Theoretical Computer Science, vol.6, issue.3, pp.255-279, 1978.
DOI : 10.1016/0304-3975(78)90008-7

. [. Courcelle, A representation of trees by languages II, Theoretical Computer Science, vol.7, issue.1, pp.25-55, 1978.
DOI : 10.1016/0304-3975(78)90039-7

T. Knapik, D. Niwi´nskiniwi´nski, P. Urzyczyn, and I. Walukiewicz, Unsafe Grammars and Panic Automata, Proc. of ICALP'05, pp.1450-1461, 2005.
DOI : 10.1007/11523468_117
URL : https://hal.archives-ouvertes.fr/hal-00335729

D. A. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035