Abstract
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.
This work was possible thanks to the FPU Fellowship AP2004-6968 from the Spanish Ministry of Education and Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Mukouchi, Y.: Characterization of finite identification. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 260–267. Springer, Heidelberg (1992)
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
Lange, S., Zilles, S.: Formal language identification: query learning vs. Gold-style learning. Information Processing Letters 91, 285–292 (2004)
Dediu, A.-H., Becerra-Bonache, L., Tîrnăucă, C.: Learning DFA from Correction and Equivalence Queries. In: Sakakibara, Y., et al. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281–292. Springer, Heidelberg (2006)
Martín-Vide, C., Mitrana, V., Păun, G. (eds.): Formal Languages and Applications. Studies in Fuzzyness and Soft Computing, vol. 148. Springer, Heidelberg (2004)
Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS, vol. 961, pp. 190–258. Springer, Heidelberg (1995)
Zeugmann, T., Lange, S., Kapur, S.: Characterizations of monotonic and dual monotonic language learning. Information and Computation 120, 155–173 (1995)
Zeugmann, T.: Inductive inference and language learning. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 464–473. Springer, Heidelberg (2006)
Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: Proc. 5th Annual Workshop on Computational Learning Theory (COLT ’92), pp. 377–390. ACM Press, New York (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tîrnăucă, C., Kobayashi, S. (2007). A Characterization of the Language Classes Learnable with Correction Queries. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)