New Techniques for Universality in Unambiguous Register Automata

Wojciech Czerwiński, Antoine Mottet, Karin Quaas

Register automata are finite automata equipped with a finite set of registers ranging over the domain of some relational structure like $(\mathbb{N};=)$ or $(\mathbb{Q};<)$. Register…