Learning regular sets from queries and counterexamples
From MaRDI portal
DOI10.1016/0890-5401(87)90052-6zbMATH Open0636.68112DBLPjournals/iandc/Angluin87OpenAlexW1989445634WikidataQ56620637 ScholiaQ56620637MaRDI QIDQ1098326FDOQ1098326
Authors: Dana Angluin 
Publication date: 1987
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(87)90052-6
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- A categorical framework for learning generalised tree automata
- Learning residual alternating automata
- Survey on mining signal temporal logic specifications
- Learning pomset automata
- Yet another canonical nondeterministic automaton
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Language learning from membership queries and characteristic examples
- Title not available (Why is that?)
- Compositional model checking for multi-properties
- Learning infinite-word automata with loop-index queries
- On the hardness of learning queries from tree structured data
- PAC learning under helpful distributions
- Learning attribute-efficiently with corrupt oracles
- Regular \(\omega\)-languages with an informative right congruence
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Certifying DFA bounds for recognition and separation
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
- A sufficient condition to polynomially compute a minimum separating DFA
- Induction and exploitation of subgoal automata for reinforcement learning
- Satisfiability and synthesis modulo oracles
- A modal logic for supervised learning
- Learning expressions and programs over monoids
- Synthesizing context-free grammars from recurrent neural networks
- On computability and learnability of the pumping lemma function
- A model learning based testing approach for kernel P systems
- Supervisor synthesis of POMDP via automata learning
- Benchmarking combinations of learning and testing algorithms for active automata learning
- Enhancing Automata Learning by Log-Based Metrics
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Learning finite state models from recurrent neural networks
- Inferring switched nonlinear dynamical systems
- A model learning based testing approach for spiking neural P systems
- Automata Learning: A Categorical Perspective
- Learning reward machines: a study in partially observable reinforcement learning
- Distributional Learning of Context-Free and Multiple Context-Free Grammars
- Approximate minimization of weighted tree automata
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- The power of random counterexamples
- Title not available (Why is that?)
- Learning tree languages from text
- Minimal consistent DFA from sample strings
- Learning algorithms
- Title not available (Why is that?)
- Learning of Structurally Unambiguous Probabilistic Grammars
- From equivalence queries to PAC learning: the case of implication theories
- On the regularity and learnability of ordered DAG languages
- The power of random counterexamples
- Robust learning of automatic classes of languages
- Learning language intersections
- MAT learners for tree series: an abstract data type and two realizations
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- Learning an extension of the class of functional dependencies with queries
- The Birth of Model Checking
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- The learnability of description logics with equality constraints
- On learning multivalued dependencies with queries
- Fast learning of restricted regular expressions and dtds
- A framework for polynomial-time query learnability
- Universal kernel-based learning with applications to regular languages
- Learning finite cover automata from queries
- Construction and learnability of canonical Horn formulas
- Learning regular languages using RFSAs.
- Learning Meets Verification
- Learning indexed families of recursive languages from positive data: A survey
- Automated assumption generation for compositional verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Classic learning
- Title not available (Why is that?)
- On the minimization of XML schemas and tree automata for unranked trees
- Learning nearly monotone \(k\)-term DNF
- PACS, simple-PAC and query learning
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- Polynomial characteristic sets for \(DFA\) identification
- The power of a pebble: Exploring and mapping directed graphs
- The grammatical inference problem for the Szilard languages of linear grammars
- Learning tree languages from positive examples and membership queries
- Verification of evolving software via component substitutability analysis
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- Generating models of infinite-state communication protocols using regular inference with abstraction
- Learning context-free grammars from structural data in polynomial time
- Regular inference as vertex coloring
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
- Active learning of nondeterministic finite state machines
- Queries and concept learning
- Learning regular omega languages
- Learning regular omega languages
- A Note on the Relationship between Different Types of Correction Queries
- Learning elementary formal systems
- Model-based learning of interaction strategies in multi-agent systems
- Distributional learning of parallel multiple context-free grammars
- Automatic Learners with Feedback Queries
- A simple algorithm for learning O(log n)-term DNF
- Recent advances of grammatical inference
- Compositional CSP traces refinement checking
- The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
- A succinct canonical register automaton model
This page was built for publication: Learning regular sets from queries and counterexamples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098326)
