On the learnability of infinitary regular sets
From MaRDI portal
Publication:1892893
DOI10.1006/inco.1995.1070zbMath0834.68099OpenAlexW2008387578MaRDI QIDQ1892893
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
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Learning infinite-word automata with loop-index queries, Learning regular omega languages, Inferring regular languages and \(\omega\)-languages, Unnamed Item, Four one-shot learners for regular tree languages and their polynomial characterizability, On syntactic congruences for \(\omega\)-languages, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words, Active automata learning as black-box search and lazy partition refinement, Inferring Symbolic Automata, Concurrent Kleene algebra with observations: from hypotheses to completeness, Learning weighted automata over principal ideal domains, Learning Meets Verification, Unnamed Item, Inference of \(\omega\)-languages from prefixes., Learning register automata: from languages to program structures, Learning pomset automata, Polynomial Identification of $$\omega $$-Automata, Automated Compositional Reasoning of Intuitionistically Closed Regular Properties, Regular \(\omega\)-languages with an informative right congruence, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES, Modular Synthesis of Timed Circuits using Partial Orders on LPNs, Checking timed Büchi automata emptiness efficiently
