Linearly Ordered Data Domains

Church Synthesis on Register Automata over Linearly Ordered Data Domains (STACS 2021)
The Church game for register automata over $(\mathbb{N}, \leq)$ is undecidable, but the one-sided game is, for deterministic ones.
Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
PDF Cite DOI
Computability of Data-Word Transductions over Different Data Domains (LMCS Special Issue dedicated to FoSSaCS 2020)
We extend the correspondence between computability and continuity over regular functions to the case of data words.
Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier
PDF Cite Slides Conference