Inferability of Unbounded Unions of Certain Closed Set Systems
- 545 Downloads
In this article, we study inferability from positive data for the unbounded union of certain class of languages. In order to show inferability, we put an emphasis on a characteristic set of a given language. We consider a class of closed set systems such that there exists an algorithm for generating a characteristic set consisting of one element. Two concrete examples of closed set systems with such algorithms are given. Furthermore, we consider applications of these examples to the study of transaction databases.
KeywordsInvariant Subspace Polynomial Ring Closure Operator Inference Algorithm Positive Data
Unable to display preview. Download preview PDF.
- 7.Kobayashi, S.: Approximate Identification, Finite Elasticity and Lattice Structure of Hypothesis Space, Technical Report, CSIM 96-04, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro-Communications (1996)Google Scholar
- 9.Motoki, T., Shinohara, T., Wright, K.: The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. In: Proceedings of COLT 1991, p. 375, 587–626. Morgan-Kaufman, San Francisco (1988)Google Scholar
- 12.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)Google Scholar