We extend the correspondence between computability and continuity over regular functions to the case of data words.
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.