Some classes of regular languages identifiable in the limit from positive data

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2484, Issue , 2002, Pages 63-76

  Denis, Francois ^a   Lemay, Aurelien ^b   Terlutte, Alain ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIV LILLE   (France)

Author keywords

Grammatical inference; Identifiability in the limit from positive data; Regular languages

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES;

GRAMMATICAL INFERENCES; POSITIVE DATA;

COMPUTATIONAL LINGUISTICS;

EID: 84943273463     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45790-9_6     Document Type: Conference Paper

References (16)

1. D. Angluin. Inductive inference of formal languages from positive data. Inform. Control, 45(2):117-135, May 1980.
2. D. Angluin. Inference of reversible languages. J. ACM, 1982.
3. M. Blum and L. Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
4. F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministic finite automata. In ICGI'2000, 5th International Colloquium on Grammatical Inference, volume 1891 of LNAI, pages 39-50. Springer Verlag, 2000.
5. F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using RFSA. In Springer-Verlag, editor, Proceedings of the 12th International Conference on Algorithmic Learning Theory (ALT-01), 2001.
6. F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. In STACS 2001, volume 2010 of LNCS, pages p. 144-157. Springer Verlag, 2001.
7. H. Fernau. Learning of terminal distinguishable languages. In Proc. AMAI 2000, 2000.
8. Henning Fernau. Identification of function distinguishable languages. In 11th International Conference on Algorithmic Learning Theory, ALT 2000, volume 1968 of LNAI, pages 116-130. Springer, 2000.
9. E. M. Gold. Language identification in the limit. Inform. Control, 10:447-474, 1967.
10. T. Head, S. Kobayashi, and T. Yokomori. Locality, reversibility and beyond: Learning languages from positive data. In ALT 98, 9th International Conference on Algorithmic Learning Theory, volume 1501 of LNAI, pages 191-204. Springer-Verlag, 1998.
11. M. Kanazawa. Learnable Classes of Categorial Grammars. The European Association for Logic, Language and Information. CLSI Publications, 1998.
12. S. Kapur. Computational Learning of Languages. PhD thesis, Cornell University, 1991.
13. S. Kobayashi and T. Yokomori. Learning concatenations of locally testable languages from positive data. LNCS, 872:407-422, 1994.
14. Satoshi Kobayashi and Takashi Yokomori. Learning approximately regular languages with reversible languages. Theoretical Computer Science, 174(1-2):251-257, 15 March 1997. Note.
15. Yasubumi Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 1992.
16. Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41-110. Springer Verlag, 1997.