activity
20122024
most citedUniversal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

19 citations · 53 across the 15 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

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.FL2016

Separability of Reachability Sets of Vector Addition Systems

Lorenzo Clemente, Wojciech Czerwiński, Sławomir Lasota +1

Given two families of sets and , the separability problem for asks whether for two given sets there ex…