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)
- 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
- Compositional CSP traces refinement checking
- The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
- A succinct canonical register automaton model
- Improving active Mealy machine learning for protocol conformance testing
- Learning register automata: from languages to program structures
- Inference of finite automata using homing sequences
- Learning of event-recording automata
- Inference of regular languages using state merging algorithms with search
- On PAC learning algorithms for rich Boolean function classes
- Grammatical inference: An old and new paradigm
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Enforcement of opacity by public and private insertion functions
- Learning Minimal Separating DFA’s for Compositional Verification
- Title not available (Why is that?)
- Learning Stochastic Logical Automaton
- Learnability of automatic classes
- Efficient learning of context-free grammars from positive structural examples
- Selection of relevant features and examples in machine learning
- Learning intersections and thresholds of halfspaces
- Automata learning with automated alphabet abstraction refinement
- Using relevance queries for identification of read-once functions
- Inferring canonical register automata
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- Necessary and sufficient conditions for learning with correction queries
- Identification of function distinguishable languages.
- A machine discovery from amino acid sequences by decision trees over regular patterns
- Probabilistic black-box reachability checking (extended version)
- Prediction-preserving reducibility
- 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
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)
