14 citations · 48 across the 26 of their papers we have counts for
Showing 2023 · cs.FLShow all
2 papers · 2 filters
cs.FL2023
Separability and Non-Determinizability of WSTS
Wojciech Czerwiński, Eren Keskin, Sławomir Lasota +4
We study the languages recognized by well-structured transition systems (WSTS) with upward and downward compatibility. Our first result shows that every pair of disjoint WSTS langu…
cs.FL2023
Regular Separability in Büchi VASS
Pascal Baumann, Roland Meyer, Georg Zetzsche
We study the (-)regular separability problem for Büchi VASS languages: Given two Büchi VASS with languages and , check whether there is a regular language that fully…