Simple Science

Cutting edge science explained simply

Cutting edge science explained simply

Eren Keskin

Formal Languages and Automata Theory Decidability of Regular Separability for VASS Reachability Languages

New method determines separability of VASS reachability languages.

2025-09-13T14:12:24+00:00 ― 6 min read

Formal Languages and Automata Theory Understanding the Regular Separability Problem in Buchi VASS

A look into the complexities of separating languages in Buchi VASS.

2025-08-02T19:57:36+00:00 ― 5 min read