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
- Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
- Learning picture sets from examples
- Learning quantum finite automata with queries
- Enhancing active model learning with equivalence checking using simulation relations
- Weighted automata extraction and explanation of recurrent neural networks for natural language tasks
- Learning and characterizing fully-ordered lattice automata
- Constructing deterministic parity automata from positive and negative examples
- Never-stop context-free learning
- From languages to behaviors and back
- Passive automata learning: DFAs and NFAs
- Efficient learning of real time one-counter automata
- Active learning of one-clock timed automata using constraint solving
- Learning deterministic one-clock timed automata via mutation testing
- Fingerprinting and analysis of Bluetooth devices with automata learning
- Learning to act and observe in partially observable domains
- Myhill-Nerode theorem for higher-dimensional automata
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Tree-Based Generation of Restricted Graph Languages
- Learning context-free grammars from positive data and membership queries
- Synthesis of hybrid automata with affine dynamics from time-series data
- On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
- Learning of restricted RNLC graph languages
- Reverse Engineering Through Automata Learning
- Active learning for sound negotiations
- Analyzing robustness of Angluin's \(\mathrm{L}^\ast\) algorithm in presence of noise
- Learning Mealy machines with one timer
- Canonical automata via distributive law homomorphisms
- Compositional automata learning of synchronous systems
- Robust learning with infinite additional information
- Active automata learning as black-box search and lazy partition refinement
- Automata and grammars for data words
- On bidirectional deterministic finite automata
- PDFA distillation with error bound guarantees
- A new approach for active automata learning based on apartness
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
- Learning realtime one-counter automata
- Learning assumptions for compositional verification of timed automata
- \(L^*\)-based learning of Markov decision processes
- Validating streaming JSON documents with learned VPAs
- Learning deterministic variable automata over infinite alphabets
- Second-order hyperproperties
- Learning communicating state machines
- Automata with timers
- Repairing timed automata clock guards through abstraction and testing
- Synthesis of distributed agreement-based systems with efficiently-decidable verification
- Timed automata verification and synthesis via finite automata learning
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
- Deterministic weighted automata under partial observability
- An active learning approach to synthesizing program contracts
- Yet another canonical nondeterministic automaton
- DKL: an efficient algorithm for learning deterministic Kripke structures
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)
