K. Aehlig, J. G. De-miranda, and L. Ong, Safety Is not a Restriction at Level 2 for String Languages, Proc. FOSSACS '05, pp.3441-490, 2005.
DOI : 10.1007/978-3-540-31982-5_31

K. Aehlig, J. G. De-miranda, and L. Ong, The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable, Proc. TLCA '05, pp.3461-3500, 2005.
DOI : 10.1007/11417170_5

K. Aehlig, T. Knapik, J. G. De-miranda, D. Niwi´nskiniwi´nski, L. Ong et al., [TYPES] Paper announcements: MSO theory of hyperalgebraic trees is decidable, 2004.

T. Cachat, Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games, Proc. ICALP 2003, pp.556-569, 2003.
DOI : 10.1007/3-540-45061-0_45
URL : https://hal.archives-ouvertes.fr/hal-00019874

T. Cachat and I. Walukiewicz, The complexity of games on higher order pushdown automata, manuscript, 2004.

D. Caucal, On infinite terms having a decidable monadic second-order theory, Proc. MFCS 2002, pp.65-176, 2002.

B. Courcelle, The monadic second-order logic of graphs IX: Machines and their behaviours, Theoretical Computer Science, vol.151, issue.1, pp.125-162, 1995.
DOI : 10.1016/0304-3975(95)00049-3

B. Courcelle and T. Knapik, The evaluation of first-order substitution is monadic second-order compatible, Theoretical Computer Science, vol.281, issue.1-2, pp.177-206, 2002.
DOI : 10.1016/S0304-3975(02)00012-9

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

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.368-377, 1991.
DOI : 10.1109/SFCS.1991.185392

J. Engelfriet, Iterated push-down automata and complexity classes, Proc. 15th STOC, pp.365-373, 1983.
DOI : 10.1145/800061.808767

J. Engelfriet, E. M. Schmidt, O. Io, and J. , IO and OI. I, Journal of Computer and System Sciences, vol.15, issue.3, pp.328-353, 1977.
DOI : 10.1016/S0022-0000(77)80034-2

T. Knapik, D. Niwi´nskiniwi´nski, and P. Urzyczyn, Deciding Monadic Theories of Hyperalgebraic Trees, Typed Lambda Calculi and Applications, 5th International Conference, 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. FoSSaCS'02 , Springer LNCS 2303, 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, draft
DOI : 10.1007/11523468_117
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.484.3216

A. N. Maslov, The hierarchy of indexed languages of an arbitrary level, Soviet Math. Dokl, vol.15, pp.1170-1174, 1974.

A. W. Mostowski, Games with forbidden positions, 1991.

D. Niwi´nskiniwi´nski, Fixed point characterization of infinite behavior of finite-state systems, Theoretical Computer Science, vol.189, issue.1-2, pp.1-69, 1997.
DOI : 10.1016/S0304-3975(97)00039-X

I. Walukiewicz, Pushdown Processes: Games and Model Checking, BRICS Report Series, vol.3, issue.54, pp.234-263, 2001.
DOI : 10.7146/brics.v3i54.20057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4162