Church Synthesis

Church Synthesis on Register Automata over Linearly Ordered Data Domains (STACS 2021)

The Church game for register automata over $(\mathbb{N}, \leq)$ is undecidable, but the one-sided game is, for deterministic ones.

Léo Exibard, Emmanuel Filiot, Ayrat Khalimov