The algebraic theory of rational languages has provided powerful decidability results.
Among them, one of the most fundamental is the definability of a rational language in the …

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

A word-to-word function is continuous for a class of languages V if its inverse maps
V_languages to V. This notion provides a basis for an algebraic study of transducers, and …

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 …

Tree-Structured Problems and Parallel Computation Page 1 Tree-Structured Problems and Parallel
Computation Dissertation der Mathematisch-Naturwissenschaftlichen Fakultät der Eberhard …

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

A word-to-word function is continuous for a class of languages~ V if its inverse maps V
_languages to~ V. This notion provides a basis for an algebraic study of transducers, and …

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 …