6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.FL2020★ 1 cited
On the complexity of the universality and inclusion problems for unambiguous context-free grammars (technical report)
Lorenzo Clemente
We study the computational complexity of universality and inclusion problems for unambiguous finite automata and context-free grammars. We observe that several such problems can be…
cs.FL2016★ 6 cited
Regular Separability of Parikh Automata
Lorenzo Clemente, Wojciech Czerwiński, Sławomir Lasota +1
We investigate a subclass of languages recognized by vector addition systems, namely languages of nondeterministic Parikh automata. While the regularity problem (is the language of…
cs.FL2014
Unified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting
Lorenzo Clemente
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of rec…