28 citations · 75 across the 20 of their papers we have counts for
3 papers · 1 filter
Deterministic and game separability for regular languages of infinite trees
Lorenzo Clemente, Michał Skrzypczak
We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separabi…
Determinisability of register and timed automata
Lorenzo Clemente, Sławomir Lasota, Radosław Piórkowski
The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed autom…
Bidimensional linear recursive sequences and universality of unambiguous register automata
Corentin Barloy, Lorenzo Clemente
We study the universality and inclusion problems for register automata over equality data. We show that the universality and the inclusion problems can be solved with 2-EXPTIME com…