@InProceedings{boker_et_al:LIPIcs.FSTTCS.2017.18,
author = {Boker, Udi and Kupferman, Orna and Skrzypczak, Michal},
title = {{How Deterministic are Good-For-Games Automata?}},
booktitle = {37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-055-2},
ISSN = {1868-8969},
year = {2018},
volume = {93},
editor = {Lokam, Satya and Ramanujam, R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.18},
URN = {urn:nbn:de:0030-drops-83776},
doi = {10.4230/LIPIcs.FSTTCS.2017.18},
annote = {Keywords: finite automata on infinite words, determinism, good-for-games}
}