Inferring regular languages and \(\omega\)-languages
From MaRDI portal
Publication:1648037
DOI10.1016/j.jlamp.2018.03.002zbMath1394.68211OpenAlexW2808742141MaRDI QIDQ1648037
Publication date: 27 June 2018
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.03.002
regular languagesgrammatical inferenceMyhill-Nerode theorem\(\omega\)-regular languagesmodel learningright congruence
Related Items (6)
Certifying DFA bounds for recognition and separation ⋮ Inferring Symbolic Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Learning residual alternating automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Active learning for extended finite state machines
- Finite-state \(\omega\)-languages
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- A syntactic congruence for rational \(\omega\)-languages
- Learning regular sets from queries and counterexamples
- Succinct representation of regular languages by Boolean automata
- Matrices de Hankel
- On syntactic congruences for \(\omega\)-languages
- Inference of \(\omega\)-languages from prefixes.
- On the learnability of infinitary regular sets
- Queries and concept learning
- Inference of finite automata using homing sequences
- Inferring Canonical Register Automata
- Sigma*
- Learning Regular Omega Languages
- Learning Weighted Automata
- Linear Automaton Transformations
- Learning Symbolic Automata
- On?-Languages whose syntactic monoid is trivial
- Learning the Language of Error
- Learning Meets Verification
- Learning I/O Automata
- Exact DFA Identification Using SAT Solvers
- Inferring Network Invariants Automatically
- Complexity of automaton identification from given data
- Families of DFAs as Acceptors of omega-Regular Languages
- Query Learning of Derived Omega-Tree Languages in Polynomial Time
- Transducers with Origin Information
- Synthesis of interface specifications for Java classes
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Testing and generating infinite sequences by a finite automaton
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Language identification in the limit
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- Tools and Algorithms for the Construction and Analysis of Systems
- Ultimately periodic words of rational ω-languages
- Efficient algorithms for the inference of minimum size DFAs
This page was built for publication: Inferring regular languages and \(\omega\)-languages
