Co-finiteness of VASS coverability languages - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Co-finiteness of VASS coverability languages

Résumé

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*).
Fichier principal
Vignette du fichier
main.pdf (326.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02193089 , version 1 (24-07-2019)
hal-02193089 , version 2 (24-07-2019)

Identifiants

  • HAL Id : hal-02193089 , version 2

Citer

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

Collections

CNRS ANR
137 Consultations
75 Téléchargements

Partager

Gmail Facebook X LinkedIn More