Properties of language classes with finite elasticity
This paper considers properties of language classes with finite elasticity in the viewpoint of set theoretic operations. Finite elasticity was introduced by Wright as a sufficient condition for language classes to be inferable from positive data, and as a property preserved by (not usual) union operation for language classes. We show that the family of language classes with finite elasticity is closed under not only union but also various operations for language classes such as intersection, concatenation and so on.
As a framework defining languages, we introduce restricted elementary formal systems (EFS's for short), called max length-bounded by which any context-sensitive language is definable. We define various operations for EFS's corresponding to usual language operations and also for EFS classes, and investigate closure properties of the family G e of max length-bounded EFS classes that define classes of languages with finite elasticity. Further-more, we present theorems characterizing a max length-bounded EFS class in the family G e , and that for the language class to be inferable from positive data, provided the class is closed under subset operation. From the former, it follows that for any n, a language class definable by max length-bounded EFS's with at most n axioms has finite elasticity. This means that G e is sufficiently large.
Unable to display preview. Download preview PDF.
- 2.S. Arikawa: Elementary formal systems and formal languages — simple formal systems. Memoirs of Fac. Sci., Kyushu Univ. Ser. A, Math. 24 (1970) 47–75.Google Scholar
- 3.S. Arikawa, T. Shinohara, and A. Yamamoto: Elementary formal system as a unifying framework for language learning. Proc. 2nd Workshop on Comput. Learning Theory (1989) 312–327.Google Scholar
- 5.S. Kapur: Computational learning of languages. PhD thesis, Technical Report 91-1234, Cornell University, September 1991.Google Scholar
- 6.S. Kapur: Monotonic language learning. Proc. 3rd Workshop on Algorithmic Learning Theory (1992) 147–158.Google Scholar
- 7.S. Lange and T. Zeugmann: Learning recursive languages with bounded mind changes. GOSLER-Report 16/92, FB Mathematik und Informatik, TH Leipzig, September 1992.Google Scholar
- 8.T. Motoki, T.Shinohara and K. Wright: The correct definition of finite elasticity: corrigendum to identification of unions. Proc. 4th Workshop on Comput. Learning Theory (1991) 375–375.Google Scholar
- 9.M. Sato and T. Moriyama: Inductive inference of length-bounded EFS's from positive data. In preparation, 1993.Google Scholar
- 10.M. Sato and K. Umayahara: Inductive inferability for formal languages from positive data. IEICE Trans. Inf. & Syst. E75-D(4) (1992) 84–92.Google Scholar
- 11.T. Shinohara: Inductive inference from positive data is powerful. Proc. 3rd Workshop on Comput. Learning Theory (1990) 97–110.Google Scholar
- 12.T. Shinohara: Inductive inference of monotonic formal systems from positive data. New Generation Computing 8 (1991) 371–384.Google Scholar
- 13.R.M. Smullyan: Theory of Formal Systems. Princeton Univ. Press, 1961.Google Scholar
- 14.K. Wright: Identification of unions of languages drawn from an identifiable class. Proc. 2nd Workshop on Comput. Learning Theory (1989) 328–333.Google Scholar
- 15.A. Yamamoto: Procedual semantics and negative information of elementary formal system. J. Logic Programming 13 (1991) 89–97.Google Scholar
- 16.A. Yamamoto: Elementary formal system as a logic programming language. Proc. Logic Program. Conf. '89, ICOT (1989) 123–132; also in Logic Programming'89, Lecture Notes in Artificial Intelligence 485 (1991).Google Scholar