Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.03561 v1 pith:F7P6LZW2 submitted 2023-07-07 cs.FL

Clément Bertrand , Cinzia Di Giusto (C&A) , Hanna Klaudel (IBISC) , Damien Regnault (IBISC) This is my paper · ORCID
classification cs.FL
keywords automatamemorynon-emptinessunboundedcomplexitymembershipproblemprove
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We study the complexity relationship between three models of unbounded memory automata: nu-automata ($\nu$-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 $\nu$-A.

Discussion (0). Continue with ORCID to comment.

Pith tools