Learning approximately regular languages with reversible languages

Theoretical Computer Science

Volumn 174, Issue 1-2, 1997, Pages 251-257

  Kobayashi, Satoshi ^a   Yokomori, Takashi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Approximate learning; Computational learning theory; Formal language theory; Identification in the limit

Indexed keywords

COMPUTATION THEORY; IDENTIFICATION (CONTROL SYSTEMS); LEARNING ALGORITHMS; LEARNING SYSTEMS;

APPROXIMATE IDENTIFICATION; APPROXIMATE LEARNING; POSITIVE DATA; REVERSIBLE LANGUAGES;

FORMAL LANGUAGES;

EID: 0031097569     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00224-1     Document Type: Article

References (9)

1. D. Angluin, Inductive inference of formal languages from positive data, Inform. and Control 45 (1980) 117-135.
2. D. Angluin, Inference of reversible languages, J. ACM 29 (1982) 741-765.
3. E.M. Gold, Language identification in the limit, Inform. and Control 10 (1967) 447-474.
4. S. Kobayashi, Approximate identification, finite elasticity and lattice structure of hypothesis space, Tech. Report, CSIM 96-04, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro-Communications, 1996.
5. S. Kobayashi and T. Yokomori, Learning approximately regular languages with reversible languages, Tech. Report, CSIM 95-03, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro-Communications, 1995.
6. Y. Mukouchi, Inductive inference of an approximate concept from positive data, in: Proc. 5th Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 872 (Springer, Berlin, 1994) 484-499.
7. J.-E. Pin, On the languages recognized by finite reversible automata, in: Proc. 14th ICALP, Lecture Notes in Computer Science, Vol. 267 (Springer, Berlin, 1987) 237-249.
8. Ch. Reutenauer, Une topologie du monoïde libre, Semigroup Forum 18 (1979) 33-49.
9. L.G. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.