A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
We study reactive synthesis of systems interacting with environments using infinite alphabets. Register automata and transducers are popular formalisms for specifying and modelling such systems. They extend finite-state automata by adding registers to store data values and to compare the incoming data values against stored ones. Synthesis from nondeterministic or universal register automata is undecidable in general. Its register-bounded variant, where additionally a bound on the number ofarXiv:2105.09978v3 fatcat:xyb2whrphncgnlit2omn2up2fm