@InProceedings{angluin_et_al:LIPIcs.CSL.2020.8,
author = {Angluin, Dana and Antonopoulos, Timos and Fisman, Dana},
title = {{Strongly Unambiguous B\"{u}chi Automata Are Polynomially Predictable With Membership Queries}},
booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)},
pages = {8:1--8:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-132-0},
ISSN = {1868-8969},
year = {2020},
volume = {152},
editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.8},
URN = {urn:nbn:de:0030-drops-116519},
doi = {10.4230/LIPIcs.CSL.2020.8},
annote = {Keywords: Polynomially predictable languages, Automata learning, Strongly unambiguous B\"{u}chi automata, Automata succinctness, Regular \omega-languages, Grammatical inference}
}