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)
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- The query complexity of finding local minima in the lattice
- An Algebraic Perspective on Boolean Function Learning
- Learning fallible deterministic finite automata
- Approximate learning of limit-average automata
- Map learning with uninterpreted sensors and effectors
- Verification of asynchronous systems with an unspecified component
- Efficient active automata learning via mutation testing
- Learning one-clock timed automata
- Active learning of timed automata with unobservable resets
- Wrapper induction: Efficiency and expressiveness
- Paradigms of truth detection
- Testing \(k\)-monotonicity
- Learning deterministic probabilistic automata from a model checking perspective
- Learning cost-sensitive active classifiers
- Minimizing depth of decision trees with hypotheses
- Structural reconfiguration of systems under behavioral adaptation
- FSM inference from long traces
- The consistency dimension and distribution-dependent learning from queries.
- On the hardness of approximating the minimum consistent OBDD problem
- Learning ordered binary decision diagrams
- Ostrowski-automatic sequences: theory and applications
- On the complexity of small description and related topics
- Regular model checking revisited
- Learning weighted automata
- Learning symbolic automata
- Title not available (Why is that?)
- Grey-Box Checking
- Synthesis of real time acceptors
- An algorithm to learn read-once threshold formulas, and transformations between learning models
- Integration Testing of Distributed Components Based on Learning Parameterized I/O Models
- Automated circular assume-guarantee reasoning
- Fast computations on ordered nominal sets
- Coalgebraic logics \& duality
- On the relationship between diagnostic and checking tests of the read-once functions
- Prefix grammars: An alternative characterization of the regular languages
- The query complexity of learning DFA
- Learning two-tape automata from queries and counterexamples
- A note on the construction of marked graphs
- Improved lower bounds for learning from noisy examples: An information-theoretic approach
- Acquiring object-knowledge
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- Inferring Symbolic Automata
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
- Learning elementary formal systems with queries.
- Inductive synthesis of recursive processes from logical properties
- Testing nonlinear operators
- Compositional reasoning
- Efficient learning of typical finite automata from random walks
- Weighted automata are compact and actively learnable
- Learning weighted automata over principal ideal domains
- Interpolation-based GR(1) assumptions refinement
- 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
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)
