Learning regular sets from queries and counterexamples
Information and Computation
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Types of monotonic language learning and their characterization
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Language learning in dependence on the space of hypotheses
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
The representation of recursive languages and its impact on the efficiency of learning
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Characterizations of monotonic and dual monotonic language learning
Information and Computation
Inference of Reversible Languages
Journal of the ACM (JACM)
Machine Learning
Machine Learning
Polynomial Time Inference of Extended Regular Pattern Languages
Proceedings of RIMS Symposium on Software Science and Engineering
A Guided Tour Across the Boundaries of Learning Recursive Languages
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Characterization of Finite Identification
AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Inductive Inference with Bounded Mind Changes
ALT '92 Proceedings of the Third Workshop on Algorithmic Learning Theory
Monotonic and Nonmonotonic Inductive Inference of Functions and Patterns
Proceedings of the 1st International Workshop on Nonmonotonic and Inductive Logic
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
Relations between gold-style learning and query learning
Information and Computation
A general comparison of language learning from examples and from queries
Theoretical Computer Science
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Learning DFA from correction and equivalence queries
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
| Hi-index | 5.23 |
We investigate the newly introduced model of learning with correction queries in the context of query learning. We present necessary and sufficient conditions for a class of languages to be inferable within this setting. We also offer a complete picture of how is the model of learning with corrections related with other well-established learning models, like the model of learning in the limit from positive data, or the one of learning with membership queries. As an application, we show that the class of k-reversible languages is learnable with correction queries.