59 citations · 220 across the 25 of their papers we have counts for
Showing 2016Show all
3 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…
cs.LO2016★ 20 cited
Simulation Problems Over One-Counter Nets
Piotr Hofman, Slawomir Lasota, Richard Mayr +1
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1…