Necessary and sufficient conditions for learning with correction queries
type: Item
instance of: scholarly article
title: Necessary and sufficient conditions for learning with correction queries
zbMATH Open document ID: 1194.68197
author: Cristina Tîrnăucă
author: Satoshi Kobayashi
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5626981
zbMATH Keywords: correction query
zbMATH Keywords: query learning
zbMATH Keywords: gold-style learning
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.004
OpenAlex ID: W1990396064
cites work: Language identification in the limit
cites work: Inductive inference of formal languages from positive data
cites work: Q4286763
cites work: Learning regular sets from queries and counterexamples
cites work: Queries and concept learning
cites work: Learning context-free grammars from structural data in polynomial time
cites work: Formal language identification: query learning vs. gold-style learning
cites work: Learning Theory
cites work: Algorithmic Learning Theory
cites work: Relations between Gold-style learning and query learning
cites work: A general comparison of language learning from examples and from queries
cites work: Grammatical Inference: Algorithms and Applications
cites work: One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
cites work: A Note on the Relationship between Different Types of Correction Queries
cites work: On Learning Regular Expressions and Patterns Via Membership and Correction Queries
cites work: Learning DFA from Correction and Equivalence Queries
cites work: Formal languages and applications.
cites work: Finding patterns common to a set of strings
cites work: Q4749224
cites work: Q4282558
cites work: Q4267809
cites work: Characterizations of monotonic and dual monotonic language learning
cites work: Theory and Applications of Models of Computation
cites work: Machines, Computations, and Universality
cites work: Inference of Reversible Languages
cites work: Algorithmic learning theory. 18th international conference, ALT 2007, Sendai, Japan, October 1--4, 2007. Proceedings
cites work: Grammatical inference: Algorithms and applications. 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22--24, 2008. Proceedings
DOI: 10.1016/J.TCS.2009.09.004
Recommended article: Q3018962
Recommended article: A Characterization of the Language Classes Learnable with Correction Queries
Recommended article: Learning via finitely many queries
Recommended article: Oracles and queries that are sufficient for exact learning
Recommended article: On learning from queries and counterexamples in the presence of noise
Recommended article: New Computational Paradigms
Recommended article: Learning via queries in [+, <]
Recommended article: Learning DFA from Correction and Equivalence Queries
Recommended article: Q5381121
Recommended article: Learning via queries and oracles
description: scientific article; zbMATH DE number 5626981