R. Alur, V. Kumar, P. Madhusudan, and M. Viswanathan, Congruences for Visibly Pushdown Languages, International Colloquium on Automata, Languages and Programming (ICALP), pp.1102-1114, 2005.
DOI : 10.1007/11523468_89

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

J. Berstel and L. Boasson, Transductions and context-free languages, 1979.
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779

C. Choffrut, ContributionàContributionà l'´ etude de quelques familles remarquables de fonctions rationnelles, 1978.

C. Choffrut, Minimizing subsequential transducers: a survey, Theoretical Computer Science, vol.292, issue.1, pp.131-143, 2003.
DOI : 10.1016/S0304-3975(01)00219-5

J. Engelfriet, S. Maneth, and H. Seidl, Deciding equivalence of top???down XML transformations in polynomial time, Journal of Computer and System Sciences, vol.75, issue.5, pp.271-286, 2009.
DOI : 10.1016/j.jcss.2009.01.001

E. Filiot, J. Raskin, P. Reynier, F. Servais, and J. Talbot, Properties of Visibly Pushdown Transducers, Mathematical Foundations of Computer Science (MFCS), pp.355-367, 2010.
DOI : 10.1007/978-3-642-15155-2_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

S. Friese, H. Seidl, and S. Maneth, Minimization of Deterministic Bottom-Up Tree Transducers, Developments in Language Theory (DLT), 2010.
DOI : 10.1007/978-3-642-14455-4_18

T. V. Griffiths, The unsolvability of the Equivalence Problem for ??-Free nondeterministic generalized machines, Journal of the ACM, vol.15, issue.3, pp.409-413, 1968.
DOI : 10.1145/321466.321473

E. M. Gurari, The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable, SIAM Journal on Computing, vol.11, issue.3, pp.448-452, 1982.
DOI : 10.1137/0211035

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2001.

A. Lemay, S. Maneth, and J. Niehren, A learning algorithm for top-down XML transformations, Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, PODS '10, pp.285-296, 2010.
DOI : 10.1145/1807085.1807122
URL : https://hal.archives-ouvertes.fr/inria-00460489

S. Maneth, Models of Tree Translation, 2003.

W. Martens, F. Neven, and M. Gyssens, Typechecking top-down XML transformations: Fixed input or output schemas, Information and Computation, vol.206, issue.7, pp.806-827, 2008.
DOI : 10.1016/j.ic.2008.01.002

J. Raskin and F. Servais, Visibly Pushdown Transducers, Automata, Languages and Programming, pp.386-397, 2008.
DOI : 10.1007/978-3-540-70583-3_32
URL : https://hal.archives-ouvertes.fr/inria-00492241

S. Staworko, G. Laurence, A. Lemay, and J. Niehren, Equivalence of nested word to word transducers, Fundamentals of Computer Theory (FCT), pp.310-322, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00423961