Learning regular omega languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 599132 (Why is no real title available?)
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- scientific article; zbMATH DE number 2079047 (Why is no real title available?)
- scientific article; zbMATH DE number 3445171 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- A syntactic congruence for rational \(\omega\)-languages
- Automatic symbolic compositional verification by learning assumptions
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Finite-state \(\omega\)-languages
- Inference of \(\omega\)-languages from prefixes.
- Learning Meets Verification
- Learning regular omega languages
- Learning regular sets from queries and counterexamples
- On syntactic congruences for \(\omega\)-languages
- On the learnability of infinitary regular sets
- On?-Languages whose syntactic monoid is trivial
- State Reduction in Incompletely Specified Finite-State Machines
- Synthesis of interface specifications for Java classes
- Testing and generating infinite sequences by a finite automaton
Cited in
(33)- Learning infinite-word automata with loop-index queries
- Learning of Regular ω-Tree Languages
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Families of DFAs as acceptors of \(\omega\)-regular languages
- Constructing deterministic \(\omega\)-automata from examples by an extension of the RPNI algorithm
- Towards a grand unification of Büchi complementation constructions
- Approximate learning of limit-average automata
- Regular \(\omega\)-languages with an informative right congruence
- Representing regular languages of infinite words using mod 2 multiplicity automata
- Active learning for sound negotiations
- \(\omega \)-automata
- Compositional automata learning of synchronous systems
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Polynomial identification of \(\omega \)-automata
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Congruence Relations for Büchi Automata
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Inferring Symbolic Automata
- Inferring regular languages and \(\omega\)-languages
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- 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
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning regular omega languages
- A categorical framework for learning generalised tree automata
- A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning deterministic automata on infinite words
- Combinatorial Image Analysis
- scientific article; zbMATH DE number 2019612 (Why is no real title available?)
- Learning regular languages over large ordered alphabets
- Constructing deterministic parity automata from positive and negative examples
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)
