A note on the emptiness problem for alternating finite-memory automata
Under an Elsevier user license
open archive
Keywords
Infinite alphabets
Alternating finite-memory automata
Alternating finite-memory tree automata
Emptiness problem
Cited by (0)
Copyright © 2014 Elsevier B.V. All rights reserved.