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