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

S. Eilenberg, Automata, Languages, and Machines, 1974.

C. C. Elgot and J. E. Mezei, On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development, vol.9, issue.1, pp.47-68, 1965.
DOI : 10.1147/rd.91.0047

J. Engelfriet, Top-down tree transducers with regular look-ahead, DAIMI Report Series, vol.4, issue.49, pp.289-303, 1977.
DOI : 10.7146/dpb.v4i49.6468

URL : http://ojs.statsbiblioteket.dk/index.php/daimipb/article/download/6468/5587

J. Engelfriet and H. Vogler, Macro tree transducers, Journal of Computer and System Sciences, vol.31, issue.1, pp.71-146, 1985.
DOI : 10.1016/0022-0000(85)90066-2

E. Filiot, J. Raskin, P. Reynier, F. Servais, and J. Talbot, Properties of Visibly Pushdown Transducers, MFCS, pp.355-367, 2010.
DOI : 10.1007/978-3-642-15155-2_32

URL : https://hal.archives-ouvertes.fr/inria-00492241

O. Gauwin, Streaming Tree Automata and XPath, 2009.
URL : https://hal.archives-ouvertes.fr/tel-00421911

J. Sakarovitch and R. De-souza, Lexicographic Decomposition of k-Valued Transducers, Theory of Computing Systems, vol.30, issue.5, pp.758-785, 2010.
DOI : 10.1007/s00224-009-9206-6

M. P. Schützenberger, Sur les relations rationnelles entre monoides libres, Theoretical Computer Science, vol.3, issue.2, pp.243-259, 1976.
DOI : 10.1016/0304-3975(76)90026-8

S. Staworko, G. Laurence, A. Lemay, and J. Niehren, Equivalence of Deterministic Nested Word to Word Transducers, FCT, pp.310-322, 2009.
DOI : 10.1007/978-3-642-03409-1_28

URL : https://hal.archives-ouvertes.fr/inria-00423961

A. Weber, Decomposing Finite-Valued Transducers and Deciding Their Equivalence, SIAM Journal on Computing, vol.22, issue.1, pp.175-202, 1993.
DOI : 10.1137/0222014