28 citations · 75 across the 20 of their papers we have counts for
24 papers · 1 filter
Multiplicity Problems on Algebraic Series and Context-Free Grammars
Nikhil Balaji, Lorenzo Clemente, Klara Nosan +2
In this paper we obtain complexity bounds for computational problems on algebraic power series over several commuting variables. The power series are specified by systems of polyno…
On Rational Recursive Sequences
Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki +1
We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of…
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…
Reachability relations of timed pushdown automata
Lorenzo Clemente, Sławomir Lasota
Timed pushdown automata (TPDA) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations of TPDA are expressible…