20 citations · 85 across the 19 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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.LO2019★ 5 cited
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
Manuel Bodirsky, Antoine Mottet, Miroslav Olšák +3
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial…