@article{Genkin201497,
Abstract = {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.},
Author = {Genkin, Daniel and Kaminski, Michael and Peterfreund, Liat},
File = {A note on the emptiness problem for alternating finite-memory automata - Genkin, Kaminski, Peterfreund (0) (0) - a - a - u.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Keywords = {Emptiness problem},
Number = {0},
Pages = {97 - 107},
Title = {A note on the emptiness problem for alternating finite-memory automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000486},
Volume = {526},
Year = {2014},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0304397514000486},
bdsk-url-2 = {http://dx.doi.org/10.1016/j.tcs.2014.01.020},
date-added = {2014-09-17 08:11:59 +0000},
date-modified = {2014-09-17 08:11:59 +0000},
doi = {10.1016/j.tcs.2014.01.020}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A