@inproceedings{bec6fec98145437b9aa413634c84ce4b,
title = "Strongly unambiguous B{\"u}chi automata are polynomially predictable with membership queries",
abstract = "A B{\"u}chi automaton is strongly unambiguous if every word w ∈ Σω has at most one final path. Many properties of strongly unambiguous B{\"u}chi automata (SUBAs) are known. They are fully expressive: every regular ω-language can be represented by a SUBA. Equivalence and containment of SUBAs can be decided in polynomial time. SUBAs may be exponentially smaller than deterministic Muller automata and may be exponentially bigger than deterministic B{\"u}chi automata. In this work we show that SUBAs can be learned in polynomial time using membership and certain non-proper equivalence queries, which implies that they are polynomially predictable with membership queries. In contrast, under plausible cryptographic assumptions, non-deterministic B{\"u}chi automata are not polynomially predictable with membership queries.",
keywords = "Automata learning, Automata succinctness, Grammatical inference, Polynomially predictable languages, Regular ω-languages, Strongly unambiguous B{\"u}chi automata",
author = "Dana Angluin and Timos Antonopoulos and Dana Fisman",
note = "Publisher Copyright: {\textcopyright} Dana Angluin, Timos Antonopoulos, and Dana Fisman.; 28th EACSL Annual Conference on Computer Science Logic, CSL 2020 ; Conference date: 13-01-2020 Through 16-01-2020",
year = "2020",
month = jan,
day = "1",
doi = "10.4230/LIPIcs.CSL.2020.8",
language = "American English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Maribel Fernandez and Anca Muscholl",
booktitle = "28th EACSL Annual Conference on Computer Science Logic, CSL 2020",
address = "Germany",
}