) Moriyama, T. and Sato, M., "Properties of Language Classes with Finite Elasticity, " in Proc. 4th International Workshop on Algorithmic Learning Theory (Lecture Notes In Artificial Intelligence 744), pp. 187-196, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Learning Elementary Formal Systems with Queries - Sakamoto, Hirata, Arimura (2000) (Correct)
....previous results on bounded unions of pattern languages [1, 31, 32, 41] Mukouchi and Arikawa [25] showed that for a hierarchy of hypothesis spaces LB EFS(m) for m 0, there exists a learner who can refute each hypothesis space if it turns out to be insufficient for identification. Moriyama, Sato [23], Mukouch [24] and Kobayashi, Yokomori [17] showed that classes of EFS enjoy various good topological properties in inductive inference. Kobayashi [18] also used EFS as a tool for uniformly showing the efficient inferability of a collection of language classes in identification in the limit. ....
T. Moriyama, M. Sato, Properties of language classes with finite elasticity, IEICE Trans. Inf. Syst., E78-D(5) (1995) 532--538.
Learning Concatenations of Locally Testable Languages from.. - Kobayashi, Yokomori (1994) (Correct)
....condition (C1) Therefore, the condition (C1) is necessary in this sense. Please note that C 1 is identifiable in the limit from positive data but that Con(C 1 ) is not identifiable in the limit from positive data, since there exists no finite tell tale(cf. Ang80] for a 3 . 2 It was shown in [MS93] that a fixed finite number of language concatenations preserves finite elasticity. Here, we have proved that under a condition (C1) Con(C) i.e. arbitrary number of language concatenations preserves finite elasticity. Note, however, that without a condition (C1) Con(C) does not preserve ....
T. Moriyama and M. Sato. Properties of Language Classes with Finite Elasticity. Proc. 4th Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744, pp.187-196, 1993
Angluin's Theorem for Indexed Families of R.e. Sets and.. - de Jongh, Kanazawa (1996) (Correct)
....proved fruitful (see, e.g. Kapur 1991 and Zeugmann and Lange 1995) For instance, Angluin s theorem has lead to easy to apply sufficient conditions for the identifiability of indexed families of recursive languages. Finite elasticity of Wright 1989 is such a condition (see also Shinohara 1990, Moriyama and Sato 1993, and Kanazawa 1994) Moreover, Zeugmann, Lange and Kapur (1992, 1995) strengthen Angluin s condition in various ways to obtain characterizations of conservativity and other restrictions on the behavior of the learner. However, these developments have had little impact on research that deals with ....
Moriyama, Takashi and Masako Sato. 1993. Properties of language classes with finite elasticity. In K. P. Jantke, S.
Two Variations of Inductive Inference of Languages from.. - Tabe, Zeugmann (1995) (Correct)
....in L j is uniformly decidable for all indices j. As a matter of fact, the definition of an indexed family contains both, a description for every enumerated language L j and a particular enumeration of all the languages from its range. Recently, this topic has attracted much attention (cf. e.g. [24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 43, 45, 50, 51]) Next we specify the information from which the target languages have to be learned. A text of a language L is an infinite sequence of strings that eventually contains all strings of L. Since a text contains exclusively positive examples concerning the target language, we sometimes refer to ....
T. Moriyama and M. Sato, Properties of language classes with finite elasticity, in: Proc. of the 4th International Workshop on Algorithmic Learning Theory Lecture Notes in Artificial Intelligence 744 (Springer-Verlag, Berlin, 1993) 187--196.
On Approximately Identifying Concept Classes in the Limit - Kobayashi, Yokomori (1995) (2 citations) (Correct)
....thickness iff for any w, the cardinality of the set fL 2 C j w 2 Lg is finite. The finite thickness is a sufficient condition for the finite elasticity. Theorem 3. Wri89] MSW90] An indexed family C is identifiable in the limit from positive data if C has finite elasticity. ut As is proved in [MS93], various kinds of operations on concept classes preserve the property of finite elasticity. Let C be a concept class. By Intsct(C) we denote the smallest class that contains C [f;g and is closed under finite intersections. Later we will use the next lemma. Lemma 4. KY94a] Let C be an indexed ....
T. Moriyama and M. Sato. Properties of Language Classes with Finite Elasticity. Proc. 4th Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744, pp.187-196, 1993
Polynomial-time Learning of Elementary Formal Systems - Miyano, Shinohara, Shinohara (2000) (5 citations) (Correct)
No context found.
) Moriyama, T. and Sato, M., "Properties of Language Classes with Finite Elasticity, " in Proc. 4th International Workshop on Algorithmic Learning Theory (Lecture Notes In Artificial Intelligence 744), pp. 187-196, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC