Article ID Journal Published Year Pages File Type
434433 Theoretical Computer Science 2014 11 Pages PDF
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
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A note on the emptiness problem for alternating finite-memory automata
Authors
, , ,