Learning regular omega languages
From MaRDI portal
Publication:329611
DOI10.1016/J.TCS.2016.07.031zbMATH Open1362.68118OpenAlexW2535981059MaRDI QIDQ329611FDOQ329611
Authors: 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
Recommendations
membership queriesactive learningequivalence queriesinfinitary languageslanguage inferenceBüchi automaton
Cites Work
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Automatic symbolic compositional verification by learning assumptions
- Synthesis of interface specifications for Java classes
- Title not available (Why is that?)
- On?-Languages whose syntactic monoid is trivial
- A syntactic congruence for rational \(\omega\)-languages
- On syntactic congruences for \(\omega\)-languages
- Inference of \(\omega\)-languages from prefixes.
- On the learnability of infinitary regular sets
- Learning regular omega languages
- Learning Meets Verification
- Title not available (Why is that?)
- State Reduction in Incompletely Specified Finite-State Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing and generating infinite sequences by a finite automaton
- Finite-state \(\omega\)-languages
Cited In (29)
- A categorical framework for learning generalised tree automata
- Representing regular languages of infinite words using mod 2 multiplicity automata
- \( \omega \)-automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Constructing deterministic parity automata from positive and negative examples
- Learning regular languages over large ordered alphabets
- Families of DFAs as acceptors of \(\omega\)-regular languages
- Combinatorial Image Analysis
- Regular \(\omega\)-languages with an informative right congruence
- Congruence Relations for Büchi Automata
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Polynomial Identification of $$\omega $$-Automata
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning regular omega languages
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression
- Kleene theorems for lasso languages and \(\omega \)-languages
- Title not available (Why is that?)
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Active learning for sound negotiations
- Compositional automata learning of synchronous systems
- Inferring Symbolic Automata
- A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
- Learning of Regular ω-Tree Languages
- Towards a grand unification of Büchi complementation constructions
- Inferring regular languages and \(\omega\)-languages
- Title not available (Why is that?)
This page was built for publication: Learning regular omega languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329611)
