Identiflability of subspaces and homomorphic images of zero-reversible languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1316, Issue , 1997, Pages 48-61

  Kobayashi, Satoshi ^a   Yokomori, Takashi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

CONCEPT CLASS; FINITELY GENERATED GROUPS; IDENTIFICATION IN THE LIMITS; POSITIVE DATA;

COMPUTATIONAL LINGUISTICS;

EID: 84958046614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_35     Document Type: Conference Paper

References (17)

1. D. Anglnin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117-135
2. D. Anglnin, Inference of reversible languages, Journal of the ACM29 (1982) 741-785
3. J. Berstel and D. Perrin, Theory of Codes, Academic Press, Inc., 1985
4. D. Jongh and M. Kanazawa, Anghin's Theorem for Indexed Families of R.E. Sets and Applications, In Proc. of the Ninth Annual Conference on Computational Learning Theory, pp.193-204 (1996)
5. S. Kobayashi and T. Yokomori, On Approximately Identifying Concept Classes in the Limit, In Prec. of 6th Workshop on Algorithmic Learning Theory, pp.298-312 (1995)
6. S. Kobayashi, 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)
7. S. Kobayashi, On Some Topological Properties of k-reversible Languages, unpublished manuscript, 1997.
8. S. Kobayashi and T. Yokomori, Learning Approximately Regular Languages with Reversible Languages, Theoretical Computer Science, Vol. 174, pp.251-257 (1997)
9. T. Moriyama and M. Sato, Properties of Language Classes with Finite Elasticity, In Proc. of 4th Workshop on Algorithmic Learning Theory, pp.187-196 (1993)
10. J.-E. Pin. On the languages recogmzed by finite reversible antomata, in: Proc. of ICALP'87, Lecture Notes in Computer Science, 267, (Springer-Verlag, 1987) 237-249
11. Ch. Reutenauer. Une topologie du monoide fibre, Semigroup Forum, 18 (1979) 33-49
12. T. Shinohaxa, Rich Classes Inferable from Positive Data: Length-Bounded Elementaxy Formal Systems, Information and Computation, 108, pp.175-186 (1994)
13. M. Sato, Inductive Inference of Formal Languages, Bulletin of Informatics and Cybernetics, Vol. 27, No.I, pp.85-106 (1995)
14. N. Tanida and T. Yokomori, Polynomlal-Time Identification of Strictly Regulax Languages in the Limit, IEICE Trans. Inf. & Syst., Vol. E75-D, No.l, pp.125-132 (1992)
15. K. Wright. Identification of unions of languages drawn from an identifiable class. In Proc. of 2nd Workshop on Computational Learning Theory, pp.328-333, 1989
16. T. Yokomori, Polynomial-Time Learning of Very Simple Grammars from Positive Data, In Proc. of 4th Workshop on Computational Learning Theory, pp.213-227, 1991
17. T. Yokomori, On Polynomial-Time Leaxnability in the Limit of Strictly Deterministic Automata, Machine Learning, Vo1.19, No.2, pp.1-27 (1995)