R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009.
DOI : 10.1145/1516512.1516518
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9971

P. R. Asveld and A. Nijholt, The inclusion problem for some subclasses of context-free languages, Theoretical Computer Science, vol.230, issue.1-2, pp.247-256, 2000.
DOI : 10.1016/S0304-3975(99)00113-9

D. Caucal, Synchronization of Pushdown Automata, Developments in Language Theory, pp.120-132, 2006.
DOI : 10.1007/11779148_12
URL : https://hal.archives-ouvertes.fr/hal-00620158

S. A. Greibach and E. P. Friedman, Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem, Journal of the ACM, vol.27, issue.4, pp.675-700, 1980.
DOI : 10.1145/322217.322224

N. Kobayashi, Model-checking higher-order functions, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.25-36, 2009.
DOI : 10.1145/1599410.1599415
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.3824

N. Kobayashi, Types and higher-order recursion schemes for verification of higherorder programs, pp.416-428, 2009.

N. Kobayashi, A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes, FoSSaCS. pp, pp.260-274, 2011.
DOI : 10.1007/978-3-642-19805-2_18

N. Kobayashi and C. H. 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

N. Kobayashi, R. Sato, and H. Unno, Predicate abstraction and CEGAR for higherorder model checking, pp.222-233, 2011.
DOI : 10.1145/1993498.1993525

N. Kobayashi, N. Tabuchi, and H. Unno, Higher-order multi-parameter tree transducers and recursion schemes for program verification, pp.495-508, 2010.
DOI : 10.1145/1706299.1706355

Y. Minamide and A. Tozawa, XML Validation for Context-Free Grammars, APLAS. Lecture Notes in Computer Science, vol.4279, pp.357-373, 2006.
DOI : 10.1007/11924661_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.9000

A. Møller and M. Schwarz, HTML validation of context-free languages, FoSSaCS, pp.426-440, 2011.

M. Murata, Hedge automata: a formal model for XML schemata, 1999.

V. T. Nguyen and M. Ogawa, Alternate stacking technique revisited: Inclusion problem of superdeterministic pushdown automata, IPSJ Transactions on Programming, vol.1, issue.1, pp.36-46, 2008.

D. Nowotka and J. Srba, Height-Deterministic Pushdown Automata, MFCS. Lecture Notes in Computer Science, vol.4708, pp.125-134, 2007.
DOI : 10.1007/978-3-540-74456-6_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.7155

C. H. Ong, On Model-Checking Trees Generated by Higher-Order Recursion Schemes, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.81-90, 2006.
DOI : 10.1109/LICS.2006.38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7084

C. Pair and A. Quéré, D?finition et etude des Bilangages r?guliers, Information and Control, vol.13, issue.6, pp.565-593, 1968.
DOI : 10.1016/S0019-9958(68)90999-6
URL : http://doi.org/10.1016/s0019-9958(68)90999-6

T. Tsukada and N. Kobayashi, Untyped Recursion Schemes and Infinite Intersection Types, FOSSACS. Lecture Notes in Computer Science, vol.6014, pp.343-357, 2010.
DOI : 10.1007/978-3-642-12032-9_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.615.9353

T. Tsukada and N. Kobayashi, A type-theoretic proof of the decidability of the language containment between context-free languages and superdeterministic languages (in japanese), IPSJ Transactions on Programming, vol.4, issue.2, pp.31-47, 2011.