Search

• < Previous
• 1
• Next >

---

Logical and Algebraic Characterizations of Rational Transductions

Emmanuel Filiot ; Olivier Gauwin ; Nathan Lhote.

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 subclass of aperiodic languages is defined by: counter-free automata, star-free expressions, aperiodic (finite)&nbsp;[&hellip;]

---

Computability of Data-Word Transductions over Different Data Domains

Léo Exibard ; Emmanuel Filiot ; Nathan Lhote ; Pierre-Alain Reynier.

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can produce the corresponding infinite outputs in the limit. We&nbsp;[&hellip;]

---