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
- 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
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)
