Regular \(\omega\)-languages with an informative right congruence
From MaRDI portal
Publication:2029605
DOI10.1016/j.ic.2020.104598zbMath1497.68247OpenAlexW3035051426MaRDI QIDQ2029605
Publication date: 3 June 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104598
Related Items (3)
Learning infinite-word automata with loop-index queries ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Polynomial Identification of $$\omega $$-Automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Characterizations of rational \(\omega\)-languages by means of right congruences
- Finite-state \(\omega\)-languages
- Learning regular sets from queries and counterexamples
- Matrices de Hankel
- On syntactic congruences for \(\omega\)-languages
- Inferring regular languages and \(\omega\)-languages
- On the learnability of infinitary regular sets
- Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
- Sigma*
- Learning Regular Omega Languages
- Learning Weighted Automata
- Learning Regular Languages over Large Ordered Alphabets
- Saturating right congruences
- Learning Symbolic Automata
- Temporal logic can be more expressive
- Learning Meets Verification
- Learning I/O Automata
- Families of DFAs as Acceptors of omega-Regular Languages
- Transducers with Origin Information
- A Generic Algorithm for Learning Symbolic Automata from Membership Queries
- A Proof of Kamp's theorem
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Ultimately periodic words of rational ω-languages
This page was built for publication: Regular \(\omega\)-languages with an informative right congruence
