Pages that link to "Item:Q1098326"
From MaRDI portal
The following pages link to Learning regular sets from queries and counterexamples (Q1098326):
Displayed 50 items.
- Learning with queries inside the class of unate \(k\)-quasi-Horn formulas (Q264959) (← links)
- Learning an extension of the class of functional dependencies with queries (Q264983) (← links)
- Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
- PACS, simple-PAC and query learning (Q294709) (← links)
- Learning regular omega languages (Q329611) (← links)
- Using relevance queries for identification of read-once functions (Q376140) (← links)
- Four one-shot learners for regular tree languages and their polynomial characterizability (Q388793) (← links)
- Learning finite cover automata from queries (Q414872) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Polynomial characteristic sets for \(DFA\) identification (Q442107) (← links)
- Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning (Q457250) (← links)
- Active learning of nondeterministic finite state machines (Q459826) (← links)
- A succinct canonical register automaton model (Q478388) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Learning sets of antecedent-restricted functional and multivalued dependencies with queries (Q503461) (← links)
- On learning multivalued dependencies with queries (Q533874) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Learning of event-recording automata (Q604474) (← links)
- Classic learning (Q676240) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Active learning for extended finite state machines (Q736459) (← links)
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists (Q746778) (← links)
- On learning from queries and counterexamples in the presence of noise (Q751304) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158) (← links)
- MAT learners for tree series: an abstract data type and two realizations (Q766165) (← links)
- Learning via finitely many queries (Q812396) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- DKL: an efficient algorithm for learning deterministic Kripke structures (Q824283) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- Learning union of integer hypercubes with queries (with applications to monadic decomposition) (Q832265) (← links)
- Active learning of sequential transducers with side information about the domain (Q832921) (← links)
- Towards refinement of abductive or inductive hypotheses through propagation (Q833731) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- The grammatical inference problem for the Szilard languages of linear grammars (Q917317) (← links)
- Learning context-free grammars from structural data in polynomial time (Q917318) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Automated assumption generation for compositional verification (Q934710) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
