Strongly unambiguous Büchi automata are polynomially predictable with membership queries

Dana Angluin, Timos Antonopoulos, Dana Fisman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication28th EACSL Annual Conference on Computer Science Logic, CSL 2020
EditorsMaribel Fernandez, Anca Muscholl
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771320
DOIs
StatePublished - 1 Jan 2020
Event28th EACSL Annual Conference on Computer Science Logic, CSL 2020 - Barcelona, Spain
Duration: 13 Jan 202016 Jan 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume152
ISSN (Print)1868-8969

Conference

Conference28th EACSL Annual Conference on Computer Science Logic, CSL 2020
Country/TerritorySpain
CityBarcelona
Period13/01/2016/01/20

Keywords

  • Automata learning
  • Automata succinctness
  • Grammatical inference
  • Polynomially predictable languages
  • Regular ω-languages
  • Strongly unambiguous Büchi automata

Fingerprint

Dive into the research topics of 'Strongly unambiguous Büchi automata are polynomially predictable with membership queries'. Together they form a unique fingerprint.

Cite this