Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Co-finiteness of VASS coverability languages

Abstract : We study the class of languages recognized by multi-counter finite state automata. These are finite automata reading letters from a finite alphabet A, equipped with n counters of natural numbers, which can be incremented or decremented by transitions. The acceptance condition requires the last state to be from the final set of states. This is equivalent to the language acceptors associated with coverability problems for labelled Petri Nets or labelled Vector Addition Systems with States (VASS).
We show that the problem of whether the complement of the language has finitely many words (i.e., whether it is «almost equal» to A*) is decidable. We do this by a reduction to the universality problem (i.e., whether it is «equal» to A*).
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Diego Figueira <>
Submitted on : Wednesday, July 24, 2019 - 2:14:07 PM
Last modification on : Monday, December 14, 2020 - 5:26:03 PM


Files produced by the author(s)


  • HAL Id : hal-02193089, version 2



Diego Figueira. Co-finiteness of VASS coverability languages. 2019. ⟨hal-02193089v2⟩



Record views


Files downloads