. Alur, Streaming String Transducers, Proceedings of the 18th International Workshop on Logic, Language, Information and Computation (WoLLIC), p.1, 2011.
DOI : 10.1007/978-3-642-20920-8_1

P. Alur and . Cerny, Expressiveness of streaming string transducers, Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.1-12, 2010.

P. Alur and . Cerny, Streaming transducers for algorithmic verification of single-pass list processing programs, Proceedings of the 38th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), 2011.

J. V. Alur and . Deshmukh, Nondeterministic streaming state transducers, Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP), pp.1-20, 2011.
DOI : 10.1007/978-3-642-22012-8_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.6918

. Courcelle, Monadic second-order definable graph transductions: a survey, Theoretical Computer Science, vol.126, issue.1, pp.53-75, 1994.
DOI : 10.1016/0304-3975(94)90268-2
URL : http://doi.org/10.1016/0304-3975(94)90268-2

H. J. Engelfriet and . Hoogeboom, MSO definable string transductions and two-way finite-state transducers, ACM Transactions on Computational Logic, vol.2, issue.2, pp.216-254, 2001.
DOI : 10.1145/371316.371512
URL : http://arxiv.org/abs/cs/9906007

H. J. Engelfriet and . Hoogeboom, MSO definable string transductions and two-way finite-state transducers, ACM Transactions on Computational Logic, vol.2, issue.2, pp.216-254, 2001.
DOI : 10.1145/371316.371512
URL : http://arxiv.org/abs/cs/9906007

S. Engelfriet and . Maneth, Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations, Information and Computation, vol.154, issue.1, pp.34-91, 1999.
DOI : 10.1006/inco.1999.2807
URL : http://doi.org/10.1006/inco.1999.2807

P. Filiot and . Reynier, On streaming string transducers and HDT0L systems. CoRR, abs, 1412.

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

M. Gurari and O. H. Ibarra, A note on finite-valued and finitely ambiguous transducers, Mathematical Systems Theory, vol.4, issue.1, pp.61-66, 1983.
DOI : 10.1007/BF01744569

I. Culik and J. Karhumäki, The equivalence of finite valued transducers (on HDT0L languages) is decidable, Theoretical Computer Science, vol.47, issue.31, pp.71-8443, 1986.
DOI : 10.1016/0304-3975(86)90134-9

. Saarela, Systems of word equations, polynomials and linear algebra: A new approach, European Journal of Combinatorics, vol.47, issue.5, pp.1-14, 2015.
DOI : 10.1016/j.ejc.2015.01.005

R. Sakarovitch and . Souza, On the decomposition of k-valued rational relations, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00256231

C. Shepherdson, The Reduction of Two-Way Automata to One-Way Automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959.
DOI : 10.1147/rd.32.0198

. Weber, On the valuedness of finite transducers, Acta Informatica, vol.27, issue.8, pp.749-780, 1990.
DOI : 10.1007/BF00264285

. Weber, Decomposing a k-valued transducer into k unambiguous ones Informatique théorique et applications, pp.379-413, 1996.
DOI : 10.1007/bfb0023852
URL : http://archive.numdam.org/article/ITA_1996__30_5_379_0.pdf