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
- DKL: an efficient algorithm for learning deterministic Kripke structures
- Active model learning of stochastic reactive systems
- An efficient query learning algorithm for ordered binary decision diagrams
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Automatic learning of subclasses of pattern languages
- A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Scalable polyhedral verification of recurrent neural networks
- Active learning of sequential transducers with side information about the domain
- Towards refinement of abductive or inductive hypotheses through propagation
- Boosting robustness verification of semantic feature neighborhoods
- Learning languages from positive data and a finite number of queries
- Statistical estimation with bounded memory
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- Minimizing Deterministic Weighted Tree Automata
- Incremental learning-based testing for reactive systems
- Learning a Random DFA from Uniform Strings and State Information
- Parameterized learnability of juntas
- Learning in the limit with lattice-structured hypothesis spaces
- A theory of formal synthesis via inductive learning
- On the learnability of vector spaces
- Title not available (Why is that?)
- Complexity of automatic sequences
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
- Property-directed verification and robustness certification of recurrent neural networks
- Title not available (Why is that?)
- Resource restricted computability theoretic learning: Illustrative topics and problems
- Exact learning from an honest teacher that answers membership queries
- Learning by switching type of information.
- Active learning for extended finite state machines
- Learning regular languages from simple positive examples
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
- Active learning for deterministic bottom-up nominal tree automata
- Polynomial-time identification of very simple grammars from positive data.
- Two-Sided Strictly Locally Testable Languages
- Query learning of derived \(\omega\)-tree languages in polynomial time
- On learning from queries and counterexamples in the presence of noise
- Polynomial inference of universal automata from membership and equivalence queries
- Learning via finitely many queries
- Learning to verify branching time properties
- Learning Integer Lattices
- Query learning of bounded-width OBDDs
- Intrinsic complexity of partial learning
- Intrinsic complexity of partial learning
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
- Real time identification of discrete event systems using Petri nets
- Learning via queries and oracles
- Minimizing deterministic weighted tree automata
- Fundamental results for learning deterministic extended finite state machines from queries
- Limitations of learning in automata-based systems
- Models of active learning in group-structured state spaces
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)
