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.
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.