We partly lift synthesis to infinite domains through register automata, targeting register transducers or computable implementations.
We extend the correspondence between computability and continuity over regular functions to the case of data words.
The Church game for register automata over $(\mathbb{N}, \leq)$ is undecidable, but the one-sided game is, for deterministic ones.
We extend the correspondence between computability and continuity over regular functions to the case of data words.
We extend the correspondence between computability and continuity over regular functions to the case of data words.
We extend the correspondence between computability and continuity over regular functions to the case of data words.
We extend the correspondence between computability and continuity over regular functions to the case of data words.
We extend the correspondence between computability and continuity over regular functions to the case of data words.