Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata

Résumé

We study the complexity relationship between three models of unbounded memory automata: nu-automata (ν-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). These are all extensions of finite state automata with unbounded memory over infinite alphabets. We prove that the membership problem is NP-complete for all of them, while they fall into different classes for what concerns non-emptiness. The problem of non-emptiness is known to be Ackermann-complete for HRA, we prove that it is PSPACE-complete for ν-A.
Fichier non déposé

Dates et versions

hal-04199269 , version 1 (07-09-2023)

Identifiants

Citer

Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault. Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. 34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.33⟩. ⟨hal-04199269⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More