A note on the emptiness problem for alternating finite-memory automata. Genkin, D., Kaminski, M., & Peterfreund, L. Theor. Comput. Sci., 526:97-107, 2014. 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
{"_id":"RwQao86gzdkyg5Yku","bibbaseid":"genkin-kaminski-peterfreund-anoteontheemptinessproblemforalternatingfinitememoryautomata-2014","downloads":0,"creationDate":"2016-04-12T13:16:32.895Z","title":"A note on the emptiness problem for alternating finite-memory automata.","author_short":["Genkin, D.","Kaminski, M.","Peterfreund, L."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/kaminski?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2014-03-16T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Genkin"],"firstnames":["Daniel"],"suffixes":[]},{"propositions":[],"lastnames":["Kaminski"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Peterfreund"],"firstnames":["Liat"],"suffixes":[]}],"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","bibtex":"@article{journals/tcs/GenkinKP14,\n added-at = {2014-03-16T00:00:00.000+0100},\n author = {Genkin, Daniel and Kaminski, Michael and Peterfreund, Liat},\n biburl = {http://www.bibsonomy.org/bibtex/28150f07642958c51c47114212fd9a4e9/dblp},\n ee = {http://dx.doi.org/10.1016/j.tcs.2014.01.020},\n interhash = {c8b5d65df2827618a809a2a868866c54},\n intrahash = {8150f07642958c51c47114212fd9a4e9},\n journal = {Theor. Comput. Sci.},\n keywords = {dblp},\n pages = {97-107},\n timestamp = {2015-06-18T08:05:08.000+0200},\n title = {A note on the emptiness problem for alternating finite-memory automata.},\n url = {http://dblp.uni-trier.de/db/journals/tcs/tcs526.html#GenkinKP14},\n volume = 526,\n year = 2014\n}\n\n","author_short":["Genkin, D.","Kaminski, M.","Peterfreund, L."],"key":"journals/tcs/GenkinKP14","id":"journals/tcs/GenkinKP14","bibbaseid":"genkin-kaminski-peterfreund-anoteontheemptinessproblemforalternatingfinitememoryautomata-2014","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.tcs.2014.01.020","Paper":"http://dblp.uni-trier.de/db/journals/tcs/tcs526.html#GenkinKP14"},"keyword":["dblp"],"downloads":0},"search_terms":["note","emptiness","problem","alternating","finite","memory","automata","genkin","kaminski","peterfreund"],"keywords":["dblp"],"authorIDs":[],"dataSources":["ePTwKNCLFT28DzR9b"]}