activity
20172025
most citedSynthesis of Data Word Transducers

8 citations · 15 across the 10 of their papers we have counts for

collaborators
Showing cs.FLShow all

6 papers · 1 filter

cs.FL2022★ 1 cited

A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov

We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automa…

cs.FL2021★ 1 cited

A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov

We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automa…

cs.FL2021★ 1 cited

Computability of Data-Word Transductions over Different Data Domains

Léo Exibard, Emmanuel Filiot, Nathan Lhote +1

In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data -words). The notion of computability is defined…

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.FL2019★ 8 cited

Synthesis of Data Word Transducers

Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier

In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifi…

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…