Polynomial Identification of $$\omega $$-Automata
From MaRDI portal
Publication:5164178
DOI10.1007/978-3-030-45237-7_20zbMath1483.68153OpenAlexW3016300907MaRDI QIDQ5164178
Dana Fisman, Dana Angluin, Yaara Shoval
Publication date: 10 November 2021
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_20
Related Items
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
Cites Work
- Learning regular omega languages
- Finite-state \(\omega\)-languages
- Teaching a smarter learner.
- Learning regular sets from queries and counterexamples
- Characteristic sets for polynomial grammatical inference
- On the learnability of infinitary regular sets
- Regular \(\omega\)-languages with an informative right congruence
- Inferring Canonical Register Automata
- Learning Regular Omega Languages
- Learning Symbolic Automata
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
- Learning the Language of Error
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Learning I/O Automata
- Complexity of automaton identification from given data
- Families of DFAs as Acceptors of omega-Regular Languages
- Mining specifications
- An automata-theoretic approach to branching-time model checking
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Tools and Algorithms for the Construction and Analysis of Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
