加载中…
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 contains while remaining disjoint from . We show that the problem is decidable in general and PSPACE-complete in the 1-dimensional case, assuming succinct counter updates. The results rely on several arguments. We characterize the set of all regular languages disjoint from . Based on this, we derive a (sound and complete) notion of inseparability witnesses, non-regular subsets of . Finally, we show how to symbolically represent inseparability witnesses and how to check their existence.

生成讲解博客的中文版本

生成AI智能校验的中文版本