Learning regular sets from queries and counterexamples
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Prediction-preserving reducibility
- Learning weighted automata over principal ideal domains
- DKL: an efficient algorithm for learning deterministic Kripke structures
- Interpolation-based GR(1) assumptions refinement
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- scientific article; zbMATH DE number 7449994 (Why is no real title available?)
- The query complexity of finding local minima in the lattice
- MAT learners for tree series: an abstract data type and two realizations
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Automatic learning of subclasses of pattern languages
- An Algebraic Perspective on Boolean Function Learning
- Robust learning of automatic classes of languages
- An efficient query learning algorithm for ordered binary decision diagrams
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas
- Learning an extension of the class of functional dependencies with queries
- Learning fallible deterministic finite automata
- A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor
- A categorical framework for learning generalised tree automata
- Learning residual alternating automata
- Survey on mining signal temporal logic specifications
- Active model learning of stochastic reactive systems
- Learning language intersections
- 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
- Learning unary automata
- The Birth of Model Checking
- Assume, guarantee or repair
- Map learning with uninterpreted sensors and effectors
- Learning pomset automata
- Approximate learning of limit-average automata
- Verification of asynchronous systems with an unspecified component
- Analyzing robustness of Angluin's \(L^*\) algorithm in presence of noise
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries
- Statistical estimation with bounded memory
- Yet another canonical nondeterministic automaton
- Efficient active automata learning via mutation testing
- Learning languages from positive data and a finite number of queries
- On learning multivalued dependencies with queries
- Fast learning of restricted regular expressions and dtds
- The learnability of description logics with equality constraints
- Active learning of timed automata with unobservable resets
- Learning picture sets from examples
- Boosting robustness verification of semantic feature neighborhoods
- Learning one-clock timed automata
- A framework for polynomial-time query learnability
- Compositional learning for interleaving parallel automata
- Universal kernel-based learning with applications to regular languages
- Learning finite cover automata from queries
- Construction and learnability of canonical Horn formulas
- Wrapper induction: Efficiency and expressiveness
- Learning regular languages using RFSAs.
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- 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 Meets Verification
- Learning indexed families of recursive languages from positive data: A survey
- Paradigms of truth detection
- 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
- Incremental learning-based testing for reactive systems
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Minimizing Deterministic Weighted Tree Automata
- Classic learning
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- Learning a Random DFA from Uniform Strings and State Information
- Language learning from membership queries and characteristic examples
- Learning infinite-word automata with loop-index queries
- Compositional model checking for multi-properties
- scientific article; zbMATH DE number 7559411 (Why is no real title available?)
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- Parameterized learnability of juntas
- Learning in the limit with lattice-structured hypothesis spaces
- On the hardness of learning queries from tree structured data
- A theory of formal synthesis via inductive learning
- Learning and characterizing fully-ordered lattice automata
- On the minimization of XML schemas and tree automata for unranked trees
- Testing \(k\)-monotonicity
- Learning deterministic probabilistic automata from a model checking perspective
- PAC learning under helpful distributions
- Constructing deterministic parity automata from positive and negative examples
- scientific article; zbMATH DE number 2077150 (Why is no real title available?)
- Never-stop context-free learning
- Learning cost-sensitive active classifiers
- On the learnability of vector spaces
- Learning nearly monotone k-term DNF
- PACS, simple-PAC and query learning
- Minimizing depth of decision trees with hypotheses
- From languages to behaviors and back
- Passive automata learning: DFAs and NFAs
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- Structural reconfiguration of systems under behavioral adaptation
- scientific article; zbMATH DE number 1804126 (Why is no real title available?)
- A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability
- Learning attribute-efficiently with corrupt oracles
- FSM inference from long traces
- A survey of model learning techniques for recurrent neural networks
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)
