The converse reduction shows that the emptiness problem for one-register alternating finite-memory automata is not primitive recursive, see [3, Theorem 5.2].
People also ask
What is the emptiness problem in finite automata?
Is the emptiness problem decidable?
What is the memory of a finite automata?
Does a finite automata have no memory?
We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory ...
A note on the emptiness problem for alternating finite-memory automata · Daniel Genkin, M. Kaminski, L. Peterfreund · Published in Theoretical Computer Science 1 ...
A note on the emptiness problem for alternating finite-memory automata. Genkin, D., Kaminski, M., & Peterfreund, L. Theor. Comput. Sci., 526:97-107, 2014.
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet.
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet.
A note on the emptiness problem for alternating finite-memory automata. We present alternative relatively simple and self-contained proofs of decidability of ...
The second year internship in the ENS offers the possibilty to get a better understanding of one particular domain of informatics.
Missing: note | Show results with:note
Apr 17, 2024 · The non-emptiness problem for intersection of 2-way NFAs reduces to non-emptiness of a single 2-way NFA. So still PSPACE-complete.
Abstract. We consider the emptiness problem for alternating tree automata, with two acceptance semantics: classical (all branches are accepted) and ...