Abstract
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possibly empty) strings of constant symbols for the variables in p.
The present paper deals with the problem of learning the erasing pattern languages and natural subclasses thereof within Angluin’s model of learning with queries. The paper extends former studies along this line of research. It provides new results concerning the principal learning capabilities of query learners as well as the power and limitations of polynomial-time query learners.
In addition, the paper focusses on a quite natural extension of Angluin’s original model. In this extended model, the query learner is allowed to query languages which are themselves not object of learning. Query learners of the latter type are often more powerful and more efficient than standard query learners. Moreover, when studying this new model in a more general context, interesting relations to Gold’s model of language learning from only positive data have been elaborated.
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
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol. 2225, pp. 12–31. Springer, Heidelberg (2001)
Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., Shinohara, T.: A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Computing 11, 361–375 (1993)
Erlebach, T., Rossmanith, P., Stadtherr, H., Steger, A., Zeugmann, T.: Learning onevariable pattern languages very efficiently on average, in parallel, and by asking questions. In: Proc. Int. Conf. on Algorithmic Learning Theory. LNCS (LNAI), vol. 1316, pp. 260–276. Springer, Heidelberg (1997)
Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)
Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. Journal of Computer and System Sciences 50, 53–63 (1995)
Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: Proc. ACM Workshop on Computational Learning Theory, pp. 377–390. ACM Press, New York (1992)
Matsumoto, S., Shinohara, A.: Learning pattern languages using queries. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS, vol. 1208, pp. 185–197. Springer, Heidelberg (1997)
Mitchell, A.: Learnability of a subclass of extended pattern languages. In: Proc. ACM Workshop on Computational Learning Theory, pp. 64–71. ACM-Press, New York (1998)
Nessel, J., Lange, S.: Learning erasing pattern languages with queries. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol. 1968, pp. 86–100. Springer, Heidelberg (2000)
Reidenbach, D.: A negative result on inductive inference of extended pattern languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 308–320. Springer, Heidelberg (2002)
Salomaa: Patterns (the formal language theory column). EATCS Bulletin 54, 46–62 (1994)
Salomaa: Return to patterns (the formal language theory column). EATCS Bulletin 55, 144–157 (1995)
Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)
Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Zeugmann, T., Lange, S. (eds.) Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol. 961, pp. 190–258. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lange, S., Zilles, S. (2003). On the Learnability of Erasing Pattern Languages in the Query Model. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds) Algorithmic Learning Theory. ALT 2003. Lecture Notes in Computer Science(), vol 2842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39624-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-39624-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20291-2
Online ISBN: 978-3-540-39624-6
eBook Packages: Springer Book Archive