scientific article
From MaRDI portal
Publication:3384896
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1809.03108
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Cites Work
- 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
- TYPENESS FOR ω-REGULAR AUTOMATA
- 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
