A note on the emptiness problem for alternating finite-memory automata
GenkinDaniel, KaminskiMichael, PeterfreundLiat · Theoretical Computer Science · 2014
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-...