Abstract
An elementary formal system, EFS for short, introduced by Smullyan is a kind of logic program over strings, and is regarded as a grammar to generate a language. Arikawa and his colleagues introduced some subclasses of EFSs which correspond to Chomsky hierarchy, and showed that they constitute a useful framework for language learning. This paper considers a subclass of EFSs, called primitive EFSs, in view of inductive inference in Gold framework from positive examples. Shinohara showed that the class of languages generated by primitive EFSs is inferable from positive examples, where ε substitutions, i.e., substitutions that may substitute the empty string for variables is not allowed. In the present paper, we consider allowing ε substitutions, and call such EFSs erasing EFSs. It is unknown whether or not the class of erasing pattern languages is learnable from positive examples. An erasing pattern language is a language generated by an erasing EFS with just one axiom.
We first show that the class \(\mathcal{PFSL}\) of languages generated by erasing primitive EFSs does not have finite elasticity, but has M-finite thickness. The notions of finite elasticity and M-finite thickness were introduced by Wright, and Moriyama and Sato, respectively, to present sufficient conditions for learnability from positive examples. Moriyama and Sato showed that a language class with M-finite thickness is learnable from positive examples if and only if for each language in the class, there is a finite tell-tale set of the language. Then we show the class \(\mathcal{PFSL}\) is learnable from positive examples by presenting a finite tell-tale set for each language in the class.
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)
Arikawa, S., Shinohara, T., Yamamoto, A.: Learning elementary formal system. Theoretical Computer Science 95, 97–113 (1992)
Arimura, H., Shinohara, T., Otsuki, S.: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 646–660. Springer, Heidelberg (1994)
Gold, E.M.: Language identification in the limit. Information and Computation 10, 447–474 (1967)
Moriyama, T., Sato, M.: Properties of language classes with finite elasticity. IEICE Transactions on Information and Systems E78-D(5), 532–538 (1995)
Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity: Corrigendum to identification of unions. In: Proceedings of the 4th Annual Workshop on Computational Learning Theory, pp. 375–375 (1991)
Mukouchi, Y., Arikawa, S.: Towards a mathematical theory of machine discovery from facts. Theoretical Computer Science 137, 53–84 (1995)
Mukouchi, Y.: Note on Learnability of Subclasses of Erasing Elementary Formal Systems from Positive Examples (in preparation)
Reidenbach, D.: 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)
Sato, M.: Inductive Inference of Formal Languages. Bulletin of Informatics and Cybernetics 27(1), 85–106 (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)
Shinohara, T.: Inductive inference of formal systems from positive data. Bulletin of Information and Cybernetics 22, 9–18 (1986)
Shinohara, T.: Rich classes inferable from positive data. Information and Control 108, 175–186 (1994)
Smullyan, R.M.: Theory of Formal Systems. Princeton University Press, Princeton (1961)
Uemura, J., Sato, M.: Compactness and Learning of Unions of Erasing Regular Pattern Languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 293–307. Springer, Heidelberg (2002)
Wright, K.: Identification of unions of languages drawn from positive data. In: Proceedings of the 2nd Annual Workshop on Computational Learning Theory, pp. 328–333 (1989)
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
Uemura, J., Sato, M. (2003). Learning of Erasing Primitive Formal Systems from Positive Examples. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-39624-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20291-2
Online ISBN: 978-3-540-39624-6
eBook Packages: Springer Book Archive