TY - GEN
T1 - Strongly unambiguous Büchi automata are polynomially predictable with membership queries
AU - Angluin, Dana
AU - Antonopoulos, Timos
AU - Fisman, Dana
N1 - Publisher Copyright:
© Dana Angluin, Timos Antonopoulos, and Dana Fisman.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - A Büchi automaton is strongly unambiguous if every word w ∈ Σω has at most one final path. Many properties of strongly unambiguous Bü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ü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üchi automata are not polynomially predictable with membership queries.
AB - A Büchi automaton is strongly unambiguous if every word w ∈ Σω has at most one final path. Many properties of strongly unambiguous Bü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ü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üchi automata are not polynomially predictable with membership queries.
KW - Automata learning
KW - Automata succinctness
KW - Grammatical inference
KW - Polynomially predictable languages
KW - Regular ω-languages
KW - Strongly unambiguous Büchi automata
UR - https://www.scopus.com/pages/publications/85077981643
U2 - 10.4230/LIPIcs.CSL.2020.8
DO - 10.4230/LIPIcs.CSL.2020.8
M3 - Conference contribution
AN - SCOPUS:85077981643
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 28th EACSL Annual Conference on Computer Science Logic, CSL 2020
A2 - Fernandez, Maribel
A2 - Muscholl, Anca
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 28th EACSL Annual Conference on Computer Science Logic, CSL 2020
Y2 - 13 January 2020 through 16 January 2020
ER -