A note on the emptiness problem for alternating finite-memory automata

doi:10.1016/j.tcs.2014.01.020

Theoretical Computer Science

Volume 526, 20 March 2014, Pages 97-107

https://doi.org/10.1016/j.tcs.2014.01.020 Get rights and content

Under an Elsevier user license

open archive

Abstract

We present alternative relatively simple and self-contained proofs of decidability of the emptiness problems for one-register alternating finite-memory automata and one-register alternating finite-memory tree automata.

Keywords

Infinite alphabets

Alternating finite-memory automata

Alternating finite-memory tree automata

Emptiness problem