Abstract
In this paper, we study a learning procedure from positive data for bounded unions of certain class of languages. Our key tools are the notion of characteristic sets and hypergraphs. We generate hypergraphs from given positive data and exploit them in order to find characteristic sets.
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
Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control 45, 117–135 (1980)
Arimura, H., Shinohara, T., Otsuki, S.: Polynomial Time Inference of Unions of Tree Pattern, Languages. In: Proc. the 2nd Workshop on Algorithmic Learning Theory (ALT 1991), pp. 105–114 (1991)
Arimura, H., Shinohara, T., Otsuki, S.: A Polynomial Time Algorithm for Finding Finite Unions of Tree Patterns. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds.) NIL 1991. LNCS, vol. 659, pp. 118–131. Springer, Heidelberg (1993)
de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of Closed Set Systems From Positive Data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol. 4384, pp. 265–275. Springer, Heidelberg (2007)
Hayashi, S.: Mathematics Based on Learning. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol. 2533, pp. 7–21. Springer, Heidelberg (2002)
Kapur, S., Bilardi, G.: On uniform learnability of language families. Information Processing Letters 44, 35–38 (1992)
Kobayashi, S.: Approximate Identification, Finite Elasticity and Lattice Structure of Hypothesis Space, Technical Report, CSIM 1996-2004, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro-Communications (1996)
Lassez, J.L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–626. Morgan-Kaufman, San Francisco (1988)
Stephan, F., Ventsov, Y.: Learning Algebraic Structures from Text. Theoretical Computer Science 268, 221–273 (2001)
Takamatsu, I., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Computing Characteristic Sets of Bounded Unions of Polynomial Ideals. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 318–329. Springer, Heidelberg (2008)
Tokunaga, H., Yamamoto, A.: Inductive Inference of Bounded Unions of Languages with Complete Characteristic Sets (in Japanese), SIG-FPAI-A703-01, 01-08 (2008)
Wright, K.: Identification of Unions of Languages Drawn from an Identifiable Class. In: Proc. of COLT 1989, pp. 328–388. Morgan-Kaufman, San Francisco (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kameda, Y., Tokunaga, H., Yamamoto, A. (2008). Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)