A note on the emptiness problem for alternating finite-memory automata. Genkin, D., Kaminski, M., & Peterfreund, L. Theor. Comput. Sci., 526:97-107, 2014.
A note on the emptiness problem for alternating finite-memory automata. [link]Link  A note on the emptiness problem for alternating finite-memory automata. [link]Paper  bibtex   
@article{journals/tcs/GenkinKP14,
  added-at = {2014-03-16T00:00:00.000+0100},
  author = {Genkin, Daniel and Kaminski, Michael and Peterfreund, Liat},
  biburl = {http://www.bibsonomy.org/bibtex/28150f07642958c51c47114212fd9a4e9/dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2014.01.020},
  interhash = {c8b5d65df2827618a809a2a868866c54},
  intrahash = {8150f07642958c51c47114212fd9a4e9},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {97-107},
  timestamp = {2015-06-18T08:05:08.000+0200},
  title = {A note on the emptiness problem for alternating finite-memory automata.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs526.html#GenkinKP14},
  volume = 526,
  year = 2014
}

Downloads: 0