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

Daniel Genkin Michael Kaminski Liat Peterfreund

Published in: Theor. Comput. Sci. (2014)

Keyphrases

finite automata
tree automata
cellular automata
memory requirements
random access
memory space
limited memory
regular expressions
computational power
computing power
information systems
finite number
coalitional games
low memory
probabilistic automata