Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was introduced. The aim of this paper is to make a further step towards the understanding of the classes of languages learnable with correction queries. We characterize these classes in terms of triples of definite finite tell-tales. This result allowed us to show that learning with correction queries is strictly more powerful than learning with membership queries, but weaker than the model of learning in the limit from positive data. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Tîrnǎucǎ, C., & Kobayashi, S. (2007). A characterization of the language classes learnable with correction queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 398–407). https://doi.org/10.1007/978-3-540-72504-6_36
Mendeley helps you to discover research relevant for your work.