R. Alur, Marrying words and trees, ACM SIGMOD-SIGACT-SIGART SPDS, vol.26, pp.233-242, 2007.
DOI : 10.1007/978-3-540-74510-5_3
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1549&context=cis_papers

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

J. Champavère, R. Gilleron, A. Lemay, and J. And-niehren, Efficient Inclusion Checking for Deterministic Tree Automata and DTDs, pp.184-195, 2008.
DOI : 10.1007/978-3-540-88282-4_18

H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard et al., Tree Auto, 2007.

J. Engelfriet, S. Maneth, and H. Seidl, Deciding Equiv. of Top-Down XML Transformations in Poly, Time. Journal of Comp. and Syst. Sci, 2009.

0. Gauwin, J. Niehren, and R. Y. , Streaming tree automata, Information Processing Letters, vol.109, issue.1, pp.13-17, 2008.
DOI : 10.1016/j.ipl.2008.08.002
URL : https://hal.archives-ouvertes.fr/inria-00288445

I. Culik, K. Karhumäki, and J. , Synchronizable deterministic pushdown automata and the decidability of their equivalence, Acta Informatica, vol.13, issue.5, pp.597-605, 1986.
DOI : 10.1007/BF00288472

. S. Maneth, Models of Tree Translation

S. Maneth, A. Berlea, T. Perst, and H. Seidl, XML type checking with macro tree transducers, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.283-294, 2005.
DOI : 10.1145/1065167.1065203
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.549

W. Martens and F. Neven, Typechecking Top-Down Uniform Unranked Tree Transducers, ICDT LNCS, vol.2572, pp.64-78, 2003.
DOI : 10.1007/3-540-36285-1_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.7559

A. Neumann and H. Seidl, Locating Matches of Tree Patterns in Forests, Found. of Soft. Tech. and Theor. Comp. Sci, pp.134-145, 1998.
DOI : 10.1007/978-3-540-49382-2_12

J. Oncina, P. Garcia, and E. Vidal, Learning subsequential transducers for pattern recognition interpretation tasks, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.5, pp.448-458, 1993.
DOI : 10.1109/34.211465
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.1566

W. Plandowski, Testing equivalence of morphisms on context-free languages, pp.460-470, 1994.
DOI : 10.1007/BFb0049431

J. Karhumäki, W. Plandowski, and W. Rytter, Polynomial Size Test Sets For Context-Free Languages, Journal of Computer and System Sciences, vol.50, issue.1, pp.11-19, 1995.
DOI : 10.1006/jcss.1995.1002

J. Raskin and F. Servais, Visibly Pushdown Transducers, Auto., Lang. and Prog. LNCS, vol.5126, pp.386-397, 2008.
DOI : 10.1007/978-3-540-70583-3_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, Auto., Lang. and Prog. LNCS, vol.1256, pp.671-681, 1997.
DOI : 10.1007/3-540-63165-8_221

A. Tozawa and Y. Minamide, Complexity Results on Balanced Context-Free Languages, FoSSaCS LNCS, vol.4423, pp.346-360, 2007.
DOI : 10.1007/978-3-540-71389-0_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.4226