2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LO2020
On Computability of Data Word Functions Defined by Transducers
Léo Exibard, Emmanuel Filiot, 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 define…
cs.FL2019★ 1 cited
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
Léo Exibard, Emmanuel Filiot, Ismaël Jecker
The transducer synthesis problem on finite words asks, given a specification , where and are sets of finite words, whether there exists an implement…
cs.FL2017★ 2 cited
Two-way Two-tape Automata
Olivier Carton, Léo Exibard, Olivier Serre
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such altern…