On the learnability of infinitary regular sets
From MaRDI portal
Publication:1892893
DOI10.1006/INCO.1995.1070zbMATH Open0834.68099OpenAlexW2008387578MaRDI QIDQ1892893FDOQ1892893
Authors: Oded Maler, Amir Pnueli 
Publication date: 10 July 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1070
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Cited In (39)
- Learning deterministic automata on infinite words
- Learning pomset automata
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Learning Meets Verification
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Uncountable automatic classes and learning
- Constructing deterministic parity automata from positive and negative examples
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- Title not available (Why is that?)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Learning regular languages over large ordered alphabets
- Combinatorial Image Analysis
- Regular \(\omega\)-languages with an informative right congruence
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Uncountable automatic classes and learning
- Checking timed Büchi automata emptiness efficiently
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning regular omega languages
- Learning regular omega languages
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Learning register automata: from languages to program structures
- The Complexity of Learning SUBSEQ (A)
- On the size of an infinite language
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Modular synthesis of timed circuits using partial orders on LPNs
- On syntactic congruences for \(\omega\)-languages
- Inference of \(\omega\)-languages from prefixes.
- Polynomial identification of \(\omega \)-automata
- On the relative sizes of learnable sets
- Learning Theory and Descriptive Set Theory
- Inferring Symbolic Automata
- Active automata learning as black-box search and lazy partition refinement
- A new approach for active automata learning based on apartness
- Inferring regular languages and \(\omega\)-languages
- Four one-shot learners for regular tree languages and their polynomial characterizability
- A class of automata for the verification of infinite, resource-allocating behaviours
- Learning weighted automata over principal ideal domains
- Title not available (Why is that?)
This page was built for publication: On the learnability of infinitary regular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892893)
