Inferring pure context-free languages from positive data

Acta Cybernetica

Volumn 14, Issue 3, 1999, Pages 469-477

  Koshiba, Takeshi ^a,c   Mäkinen, Erkki ^b   Takada, Yuji ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^c Telecommunications Advancement Organization of Japan   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 9444220043     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. D. Angluin, Finding patterns common to a string, J. Comput. Syst. Sci. 21 (1980), 46-62.
2. D. Angluin, Inductive inference of formal languages from positive data, Inform. Contr. 45 (1980), 117-135.
3. D. Angluin, Inference of reversible languages, J. ACM 29 (1982), 741-765.
4. D. Angluin and C.H. Smith, Inductive inference: theory and methods, ACM Comput. Surv. 15 (1983), 237-269.
5. W. Bucher and J. Hagauer, It is decidable whether a regular language is pure context-free. Theoret. Comput. Sci. 26 (1983), 233-241.
6. S. Crespi-Reghizzi, G. Guida, and D. Mandrioli, Noncounting context-free languages, J. ACM 25 (1978), 571-580.
7. A. Gabrelian, Pure grammars and pure languages, Intern. J. Comput. Math. 9 (1981), 3-16.
8. P. Garcia, E. Vidal and J. Oncina, Learning locally testable languages in the strict sense, in: Proceedings of the First International Workshop on Algorithmic Learning Theory (1990), 325-338.
9. E.M. Gold, Language identification in the limit, Inform. Contr. 10 (1967), 447-474.
10. J. Hagauer, A simple variable-free CF grammar generating a non regular language. Bull. EATCS 6 (1978), 28-33.
11. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, 1978).
12. T. Koshiba, E. Mäkinen, and Y. Takada, Learning deterministic even linear languages from positive data, Theoret. Comput. Sci. 185 (1997), 63-79.
13. E. Mäkinen, Inferring uniquely terminating regular languages from positive data, Inf. Process. Lett. 62 (1997), 57-60.
14. H.A. Maurer, A. Salomaa, and D. Wood, Pure grammars, Inform. Contr. 44 (1980), 47-72.
15. T. Motoki, T. Shinohara, and K. Wright, The correct definition of finite elasticity: Corrigendum to identification of unions, in: Proceedings of 4th Workshop on Computational Learning Theory (1991), 375.
16. N. Tanida and T. Yokomori, Inductive inference of monogenic pure contex-free languages, Lecture Notes in Computer Science 872 (1994), 560-573.
17. K. Wright, Identification of unions of languages drawn from an identifiable class, in: Proceedings of 2nd Workshop on Computational Learning Theory (1989), 328-333.
18. T. Yokomori, Inductive inference of OL languages, in: G. Rozenberg and A. Salomaa (eds.), Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology, Springer, 1992, 115-132.