R. Alur and P. Cern´ycern´y, Expressiveness of streaming string transducers, Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.1-12, 2010.

M. Béal and O. Carton, Determinization of transducers over finite and infinite words, Theoretical Computer Science, vol.289, issue.1, pp.225-251, 2002.
DOI : 10.1016/S0304-3975(01)00271-7

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

M. Bojanczyk, Transducers with Origin Information, 41st Internationl Colloquium on Automata, Languages, and Programming (ICALP), pp.26-37, 2014.
DOI : 10.1007/978-3-662-43951-7_3

M. Cadilhac, A. Krebs, M. Ludwig, and C. Paperman, A Circuit Complexity Approach to Transductions, Mathematical Foundations of Computer Science, pp.141-153, 2015.
DOI : 10.1007/978-3-662-48057-1_11

O. Carton and L. Dartois, Aperiodic two-way transducers and FOtransductions, Computer Science Logic (CSL), volume 41 of LIPIcs, pp.160-174, 2015.

S. Cho and D. T. Huynh, Finite-automaton aperiodicity is PSPACE-complete, Theoretical Computer Science, vol.88, issue.1, pp.99-116, 1991.
DOI : 10.1016/0304-3975(91)90075-D

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

B. 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

B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second-Order Logic -A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications, 2012.

V. Diekert and P. Gastin, First-order definable languages In Logic and Automata: History and Perspectives, Logic and Games, pp.261-306, 2008.

V. Diekert and M. Kufleitner, Omega-Rational Expressions with Bounded Synchronization Delay, Theory of Computing Systems, vol.13, issue.3, pp.686-696, 2015.
DOI : 10.1007/s00224-013-9526-4

V. Diekert, P. Gastin, and M. Kufleitner, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.513-548, 2008.
DOI : 10.1142/S0129054108005802

H. Ebbinghaus and J. Flum, Finite model theory. Perspectives in Mathematical Logic, 1995.

J. Engelfriet and H. J. 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

E. Filiot, Logic-Automata Connections for Transformations, Logic and Its Applications (ICLA), pp.30-57, 2015.
DOI : 10.1007/978-3-662-45824-2_3

E. Filiot, O. Gauwin, P. Reynier, and F. Servais, From Two-Way to One-Way Finite State Transducers, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.468-477, 2013.
DOI : 10.1109/LICS.2013.53
URL : https://hal.archives-ouvertes.fr/hal-00946161

E. Filiot, S. N. Krishna, and A. Trivedi, First-order definable string transformations, Foundation of Software Technology and Theoretical Computer Science, pp.147-159, 2014.

I. Gurari, A note on finite-valued and finitely ambiguous transducers, Mathematical Systems Theory, vol.4, issue.1, 1983.
DOI : 10.1007/BF01744569

C. Lautemann, P. Mckenzie, T. Schwentick, and H. Vollmer, The descriptive complexity approach to LOGCFL, 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1563 of LNCS, pp.444-454, 1999.

L. Libkin, Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series, 2004.

P. Mckenzie, T. Schwentick, D. Thérien, and H. Vollmer, The many faces of a translation, J. Comput. Syst. Sci, vol.724, issue.1, pp.163-17927, 2006.

R. Mcnaughton and S. Papert, Counter-free automata. M.I, 1971.

J. Pin and H. Straubing, Some results on C-varieties, ITA, vol.39, issue.1, pp.239-262, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00112835

C. Reutenauer and M. Schützenberger, Minimization of Rational Word Functions, SIAM Journal on Computing, vol.20, issue.4, pp.669-685, 1991.
DOI : 10.1137/0220042

C. Reutenauer and M. Schützenberger, Vari??t??s et fonctions rationnelles, Theoretical Computer Science, vol.145, issue.1-2, pp.229-240, 1995.
DOI : 10.1016/0304-3975(94)00180-Q

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

M. Schützenberger, A remark on finite transducers, Information and Control, vol.4, issue.2-3, pp.185-196, 1961.
DOI : 10.1016/S0019-9958(61)80006-5

M. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.190-194, 1965.
DOI : 10.1016/S0019-9958(65)90108-7

H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, vol.4, p.27, 1994.
DOI : 10.1007/978-1-4612-0289-9