Expressiveness of streaming string transducers, FSTTCS, vol.8, pp.1-12, 2010. ,
From monadic second-order definable string transformations to transducers, LICS, pp.458-467, 2013. ,
Regular transformations of infinite strings, LICS, pp.65-74, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01196262
Aperiodic two-way transducers and fo-transductions, CSL, volume 41 of LIPIcs, pp.160-174, 2015. ,
Serial composition of 2-way finite-state transducers and simple programs on strings, Automata, languages and programming, vol.52, pp.135-137, 1977. ,
Méthodes algébriques pour la théorie des automates, 2014. ,
Uniformisation of two-way transducers, LATA, pp.547-558, 2013. ,
MSO definable string transductions and two-way finite-state transducers, ACM Trans. Comput. Log, vol.2, issue.2, pp.216-254, 2001. ,
Logic-automata connections for transformations, ICLA, vol.8923, pp.30-57, 2015. ,
First-order definability of rational transductions: An algebraic approach, LICS, pp.387-396, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01308509
From two-way to one-way finite state transducers, LICS, pp.468-477, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00946161
First-order definable string transformations, vol.8, 2018. ,
, Schloss Dagstuhl-Leibniz-Zent. Inform, vol.29, pp.147-159, 2014.
Counter-free automata, 1971. ,
On finite monoids having only trivial subgroups, Information and Control, vol.8, pp.190-194, 1965. ,
The reduction of two-way automata to one-way automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959. ,