Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

We study finite-state transducers and their power for transforming infinite words. Infinite
sequences of symbols are of paramount importance in a wide range of fields, from formal …

Although finite state transducers are very natural and simple devices, surprisingly little is
known about the transducibility relation they induce on streams (infinite words). We collect …

To extend a natural concept of equivalence of sequences to two-sided infinite sequences,
the notion of permutation transducer is introduced. Requiring the underlying automaton to …

We answer an open question in the theory of transducer degrees initially posed in Endrullis
et al.(2016, Proc. Conf. on Developments in Language Theory (DLT 2016), 164–176), on the …

Rational transductions are relations computed by generalised finite automata with input and
output. Their history goes back to the early days of automata theory, especially to the paper …

We answer an open question in the theory of degrees of infinite sequences with respect to
transducibility by finite-state transducers. An initial study of this partial order of degrees was …

Transducers order infinite sequences into natural classes, but permutation transducers
provide a finer classification, respecting certain changes to finite segments. We investigate …

We answer an open question in the theory of transducer degrees initially posed in [3], on the
structure of polynomial transducer degrees, in particular the question of what degrees, if any …

We answer an open question in the theory of transducer degrees initially posed in [1] on the
existence of a diamond structure in the transducer hierarchy. Transducer degrees are the …