Learning infinite-word automata with loop-index queries
From MaRDI portal
Publication:2124472
DOI10.1016/j.artint.2022.103710OpenAlexW4220776705MaRDI QIDQ2124472
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103710
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Finite-state \(\omega\)-languages
- Handbook of weighted automata
- Learning regular sets from queries and counterexamples
- Generalization bounds for learning weighted automata
- On the learnability of infinitary regular sets
- Regular \(\omega\)-languages with an informative right congruence
- On the Rademacher Complexity of Weighted Automata
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Learning Regular Omega Languages
- Quantitative languages
- Learning Weighted Automata
- On the Merits of Temporal Testers
- Learning Meets Verification
- Learning Multiplicity Tree Automata
- Cryptographic limitations on learning Boolean formulae and finite automata
- Handbook of Model Checking
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- From average case complexity to improper learning complexity
- Learning nominal automata
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Ultimately periodic words of rational ω-languages
This page was built for publication: Learning infinite-word automata with loop-index queries
