Regular Separability for Bidirected VASS
cs.FL
Submitted: 2026-11-02
Updated: 2026-11-13
Terminology
Sources
- The complexity of separability for semilinear sets and Parikh automata
- Separability and Non-Determinizability of WSTS
Related papers
- Quantitative Verification of Infinite-State Networks
- A Unary-to-Nonunary Transition in the Accepting-State Spectrum of Right Quotient for Permutation Automata
- Positive-Data Learning of Fixed-Observation Linear MCFGs from Working Binary Presentations
- On the Separability Problem of VASS Reachability Languages
- Exact Accepting-State Spectrum for Reversal of Permutation Automata
- An exact compress-with-another threshold in a binary automaton family