Abstract
An elementary formal system, EFS for short, is a kind of logic program over strings, and regarded as a set of rules to generate a language. For an EFS Γ, the language L(Γ) denotes the set of all strings generated by Γ. Many researchers studied the learnability of EFSs in various learning models. In this paper, we introduce a subclass of EFSs, denoted by \(r\cal E\!F\!S\), and study the learnability of \(r\cal E\!F\!S\) in the exact learning model. The class \(r\cal E\!F\!S\) contains the class of regular patterns, which is extensively studied in Learning Theory.
Let Γ ∗ be a target EFS of learning in \(r\cal E\!F\!S\). In the exact learning model, an oracle for superset queries answers “yes” for an input EFS Γ in \(r\cal E\!F\!S\) if L(Γ) is a superset of L(Γ ∗ ), and outputs a string in L(Γ ∗ ) – L(Γ), otherwise. An oracle for membership queries answers “yes” for an input string w if w is included in L(Γ ∗ ), and answers “no”, otherwise.
We show that any EFS in \(r\cal E\!F\!S\) is exactly identifiable in polynomial time using membership and superset queries. Moreover, for other types of queries, we show that there exists no polynomial time learning algorithm for \(r\cal E\!F\!S\) by using the queries. This result indicates the hardness of learning the class \(r\cal E\!F\!S\) in the exact learning model, in general.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Science 21, 46–62 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Arikawa, S.: Elementary formal systems and formal languages - simple formal systems. Memoirs of Faculty of Science, Kyushu University, Series A, Mathematics 24, 47–75 (1970)
Arikawa, S., Shinohara, T., Yamamoto, A.: Learning elementary formal systems. Theoretical Computer Science 95, 97–113 (1992)
Matsumoto, S., Shinohara, A.: Learning pattern languages using queries. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS (LNAI), vol. 1208, pp. 185–197. Springer, Heidelberg (1997)
Matsumoto, S., Shinohara, A., Arimura, H., Shinohara, T.: Learning subsequence languages. In: Information Modelling and Knowledge Bases VIII, pp. 335–344. IOS Press, Amsterdam (1997)
Matsumoto, S., Shoudai, T., Miyahara, T., Uchida, T.: Learning of finite unions of tree patterns with internal structured variables from queries. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 523–534. Springer, Heidelberg (2002)
Sakamoto, H., Hirata, K., Arimura, H.: Learning elementary formal systems with queries. Theoretical Computer Science 298, 21–50 (2003)
Sato, M., Mukouchi, Y., Zheng, D.: Characteristic sets for unions of regular pattern languages and compactness. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds.) ALT 1998. LNCS (LNAI), vol. 1501, pp. 220–233. Springer, Heidelberg (1998)
Shinohara, T.: Inductive inference of formal systems from positive data. Bulletin of Informatics and Cybernetics 22, 9–18 (1986)
Uemura, J., Sato, M.: Learning of erasing primitive formal systems from positive examples. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol. 2842, pp. 69–83. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kato, H., Matsumoto, S., Miyahara, T. (2005). Learning of Elementary Formal Systems with Two Clauses Using Queries. In: Jain, S., Simon, H.U., Tomita, E. (eds) Algorithmic Learning Theory. ALT 2005. Lecture Notes in Computer Science(), vol 3734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564089_18
Download citation
DOI: https://doi.org/10.1007/11564089_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29242-5
Online ISBN: 978-3-540-31696-1
eBook Packages: Computer ScienceComputer Science (R0)