4 citations · 4 across the 4 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2021
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 or . Register…
cs.FL2019★ 4 cited
On the Containment Problem for Unambiguous Single-Register Automata with Guessing
Antoine Mottet, Karin Quaas
Register automata extend classical finite automata with a finite set of registers that can store data from an infinite data domain for later equality comparisons with data from an…
cs.FL2018
The Containment Problem for Unambiguous Register Automata
Antoine Mottet, Karin Quaas
We investigate the complexity of the containment problem "Does hold?", where is an unambiguous register automaton and is an arbitrary register automato…