B. S. Baker, Composition of top-down and bottom-up tree transductions, Information and Control, vol.41, issue.2, pp.186-213, 1979.
DOI : 10.1016/S0019-9958(79)90561-8

A. Boiret, Normalization and Learning of Transducers on Trees and Words, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01396543

M. Bojá-nczyk, Transducers with origin information, ICALP 2014, pp.26-37, 2014.

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

URL : http://doi.org/10.1016/s0304-3975(01)00219-5

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, Bottom-up and top-down tree transformations??? a comparison, Mathematical Systems Theory, vol.2, issue.2, pp.198-231, 1975.
DOI : 10.1016/S0022-0000(70)80017-4

URL : https://ris.utwente.nl/ws/files/6529681/Engelfriet75bottom.pdf

J. Engelfriet, Top-down tree transducers with regular look-ahead, Mathematical Systems Theory, vol.4, issue.1, pp.289-303, 1976.
DOI : 10.1007/BF01683280

URL : https://ris.utwente.nl/ws/files/6555608/Engelfriet77top.pdf

J. Engelfriet, Top-down tree transducers with regular look-ahead, Mathematical Systems Theory, vol.4, issue.1, pp.289-303, 1977.
DOI : 10.1007/BF01683280

URL : https://ris.utwente.nl/ws/files/6555608/Engelfriet77top.pdf

J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, pp.241-286, 1980.

J. Engelfriet and S. Maneth, Macro Tree Translations of Linear Size Increase are MSO Definable, SIAM Journal on Computing, vol.32, issue.4, pp.950-1006, 2003.
DOI : 10.1137/S0097539701394511

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

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

Z. Ésik, On functional tree transducers, FCT, pp.121-127, 1979.

Z. Ésik, Decidability results concerning tree transducers II, Acta Cybern, vol.6, issue.3, pp.303-314, 1983.

Z. Fülöp and H. Vogler, Forward and backward application of symbolic tree transducers, Acta Informatica, vol.105, issue.4, pp.297-325, 2014.
DOI : 10.1016/S0022-0000(70)80017-4

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, Equivalence Problems for Tree Transducers: A Brief Survey, Electronic Proceedings in Theoretical Computer Science, vol.151, pp.74-93, 2014.
DOI : 10.4204/EPTCS.151.5

URL : http://arxiv.org/abs/1405.5597

H. Seidl, S. Maneth, and G. Kemper, Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp.943-962, 2015.
DOI : 10.1109/FOCS.2015.62

M. Veanes and N. Bjørner, Foundations of finite symbolic tree transducers, EATCS, vol.105, pp.141-173, 2011.

M. Veanes and N. Bjørner, Symbolic Tree Transducers, PSI, pp.377-393, 2011.
DOI : 10.1007/978-3-642-29709-0_32