1 citations · 1 across the 2 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
Pascal Baumann, Eren Keskin, Roland Meyer +1
The omega-regular separability problem for Büchi VASS coverability languages has recently been shown to be decidable, but with an EXPSPACE lower and a non-primitive recursive upper…
cs.FL2024★ 1 cited
On the Separability Problem of VASS Reachability Languages
Eren Keskin, Roland Meyer
We show that the regular separability problem of VASS reachability languages is decidable and -complete. At the heart of our decision procedure are doubly-marked grap…
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…