Transducers are finite-state machines which compute functions (or relations) from words to
words. They can be seen as simple programs with limited memory which manipulate strings …

Regular functions from infinite words to infinite words can be equivalently specified by MSO-
transducers, streaming ω-string transducers as well as deterministic twoway transducers …

Rational word languages can be defined by several equivalent means: finite state automata,
rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust …

We prove a noncommutative generalisation of Mahler's theorem on interpolation series, a
celebrated result of p-adic analysis. Mahler's original result states that a function from N to Z …

Transducers define word-to-word transformations by extending automata with outputs. We
study some decision problems related to transducers. First, we characterize some resources …

Transducers are finite-state machines which compute functions (or relations) from words to
words. They can be seen as simple programs with limited memory which manipulate strings …

Let p be a prime number and let G_p be the variety of all languages recognised by a finite p-
group. We give a construction Let p be a prime number and let G_p be the variety of all …

In the first part of this manuscript we focus on the study of rational functions, functions
defined by one-way transducers. Our goal is to extend to transductions the many logic …

We prove a noncommutative generalisation of Mahler's theorem on interpolation series, a
celebrated result of p-adic analysis. Mahler's original result states that a function from N to Z …

La robuste théorie des langages rationnels est basée sur trois piliers fondamentaux: le
calcul (automates), la logique, et l'algèbre. Dans ce chapitre, nous introduisons le lecteur …