Synthesis can be lifted to infinite domains through register automata, targeting register transducers implementations.
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.
Register automata are a counterpart of finite automata over data words. Synthesis algorithms can (sometimes) be extended to them.
Multi-sequential specifications are recognised by unions of sequential transducers. Their synthesis problem is PSpace-complete.
Multi-sequential specifications are recognised by unions of sequential transducers. Their synthesis problem is PSpace-complete.