Learning regular omega languages

DOI10.1016/j.tcs.2016.07.031zbMath1362.68118OpenAlexW2535981059MaRDI QIDQ329611

Dana Angluin, Dana Fisman

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.031

zbMATH Keywords

active learningmembership queriesBüchi automatonequivalence queriesinfinitary languageslanguage inference

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items

Learning infinite-word automata with loop-index queries, Inferring regular languages and \(\omega\)-languages, Unnamed Item, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, Towards a grand unification of Büchi complementation constructions, Inferring Symbolic Automata, Representing regular languages of infinite words using mod 2 multiplicity automata, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, Unnamed Item, Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression, Concurrent Kleene algebra with observations: from hypotheses to completeness, Unnamed Item, Polynomial Identification of $$\omega $$-Automata, Regular \(\omega\)-languages with an informative right congruence, A Myhill-Nerode theorem for register automata and symbolic trace languages, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, \( \omega \)-automata, A categorical framework for learning generalised tree automata

Cites Work

• Finite-state \(\omega\)-languages
• Automatic symbolic compositional verification by learning assumptions
• A syntactic congruence for rational \(\omega\)-languages
• Learning regular sets from queries and counterexamples
• On syntactic congruences for \(\omega\)-languages
• Inference of \(\omega\)-languages from prefixes.
• On the learnability of infinitary regular sets
• Learning Regular Omega Languages
• On?-Languages whose syntactic monoid is trivial
• Learning Meets Verification
• State Reduction in Incompletely Specified Finite-State Machines
• Synthesis of interface specifications for Java classes
• Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item