Data Words

Synthesis of Data Word Transducers (LMCS Special Issue dedicated to CONCUR 2019)
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
PDF Cite Poster Slides DOI Conference
On Computability of Data Word Functions Defined by Transducers (FoSSaCS 2020)
We extend the correspondence between computability and continuity over regular functions to the case of data words.
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
PDF Cite Poster Slides Video DOI Journal Short video
Synthesis of Data Word Transducers (CONCUR 2019)
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
PDF Cite Poster Slides DOI Journal