Abstract
We present a new learning algorithm introducing a helpful teacher who models the learners’ knowledge. Our algorithm, called learning from extensions (LEX), learns finite-state transducers using only one type of query called extension query. Our query was inspired by equivalence queries and counterexamples, but we show in this article that it is possible to learn efficiently finite state transducers using only extension queries (it is known that only with membership queries or only with equivalence queries is not possible). The teacher answers an extension query by connecting the new information asked by the learner with the information that the learner already knows. We prove that our new algorithm LEX discovers a target finite-state transducer in polynomial time. We also discuss briefly several complexity aspects and we give an example.
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(5), 447–474 (1967)
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)
Valiant, L.G.: A theory of the learnable. Communications of the ACM 27(11), 1134–1142 (1984)
Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: STOC 1989: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 411–420. ACM Press, New York (1989)
Balcazar, J.L., Diaz, J., Gavalda, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53–72 (1997)
Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121–150 (1990)
Becerra-Bonache, L., Dediu, A.H., Tîrnăucă, C.: Learning DFA from correction and equivalence queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281–292. Springer, Heidelberg (2006)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Massachusetts (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becerra-Bonache, L., Dediu, A.H. (2009). Learning from a Smarter Teacher. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-04394-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04393-2
Online ISBN: 978-3-642-04394-9
eBook Packages: Computer ScienceComputer Science (R0)