Universality Problem for Unambiguous VASS
Formal Languages and Automata Theory
2020-07-22 v1 Logic in Computer Science
Abstract
We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defined by a set of final states (i.e., the coverability language). We show that the problem of universality for unambiguous VASS is ExpSpace-complete, in sheer contrast to Ackermann-completeness for arbitrary VASS, even in dimension 1. When the dimension d is fixed, the universality problem is PSpace-complete if d is at least 2, and coNP-hard for 1-dimensional VASSes (also known as One Counter Nets).
Cite
@article{arxiv.2007.10907,
title = {Universality Problem for Unambiguous VASS},
author = {Wojciech Czerwiński and Diego Figueira and Piotr Hofman},
journal= {arXiv preprint arXiv:2007.10907},
year = {2020}
}