Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science

Volumn 241, Issue 1-2, 2000, Pages 191-209

  Shinohara, Takeshi ^a   Arimura, Hiroki ^b  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012538905     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00270-4     Document Type: Article

References (25)

1. D. Angluin, Finding common patterns to a set of strings, in: Proc. 11th Ann. Symp. Theory of Computing, 1979, pp. 130-141.
2. D. Angluin, Inductive inference of formal languages from positive data, Inform. Control 45 (1980) 117-135.
3. H. Arimura, H. Ishizaka, T. Shinohara, Polynomial time inference of a subclass of context-free transformations, in: Proc. 5th Ann. ACM Workshop on Computational Learning Theory, 1992, pp. 136-143.
4. S. Arikawa, S. Kuhara, S. Miyano, A. Shinohara, T. Shinohara, A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains, in: Proc. 25th Hawaii Int. Conf. on System Sciences, Vol. I, 1992, pp. 675-684.
5. S. Arikawa, S. Miyano, A. Shinohara, S. Kuhara, Y. Mukouchi, T. Shinohara, A machine discovery from amino acid sequences by decision trees over regular patterns, New Gen. Comput. 11 (1993) 361-375.
6. H. Arimura, T. Shinohara, S. Otsuki, Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, in: Proc. STACS'94, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 649-660.
7. H. Arimura, T. Shinohara, S. Otsuki, H. Ishizaka, A generalization of the least general generalization, Mach. Intell. 13, 59-85, Oxford Univ. Press, Oxford, 1994.
8. S. Arikawa, T. Shinohara, A. Yamamoto, Learning elementary formal systems, Theoret. Comput. Sci. 95 (1992) 97-113.
9. E.M. Gold, Language identification in the limit, Informat. Control 10 (1967) 447-474.
10. K.P. Jantke, S. Lange, Case-based representation and learning of pattern languages, in: Proc. 4th Int. Workshop on Algorithmic Learning Theory, LNAI, Vol. 744, Springer, Berlin, 1993, pp. 87-100.
11. T. Jiang, A. Salomaa, K. Salomaa, S. Yu, Decision problems for patterns, J. Comput. System Sci. 50 (1995) 53-63.
12. J.B. Kruskal, The theory of well-quasi-ordering: a frequently discovered concept, J. Combin. Theory A 13 (1972) 297-305.
13. S. Lange, T. Zeugmann, Language learning in dependence on the space of hypotheses, in: Proc. 6th ACM Workshop on Computational Learning Theory, ACM Press, New York, 1993, pp. 127-136.
14. T. Motoki, T. Shinohara, K. Wright, The correct definition of finite elasticity: corrigendum to identification of unions, in: Proc. 4th Ann. Workshop on Computational Learning Theory 1991, p. 375.
15. Y. Mukouchi, Containment problems for pattern languages, IEICE Trans. Inform. Systems E75-D (1992) 420-425.
16. R.P. Nix, Editing by example, Research Report 280, Department of Computer Science, Yale University, 1983.
17. T. Shinohara, Polynomial time inference of pattern languages and its applications, in: Proc. 7th IBM Symp. on Mathematical Foundations of Computer Science, 1982, pp. 191-209.
18. T. Shinohara, Polynomial time inference of extended regular pattern languages in: Proc. RIMS Symp. on Software Science and Engineering, Kyoto, 1982, Lecture Notes in Computer Science, Vol. 147, Springer, Berlin, 1983, pp. 115-127.
19. T. Shinohara, Inferring unions of two pattern languages, Bull. Inform. Cybernet. 20 (1983) 83-88.
20. T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Gen. Comput. 8 (1991) 371-384.
21. T. Shinohara, Rich classes inferable from positive data: length-bounded elementary formal systems, Inform. Comput. 108 (1994) 175-186.
22. R.M. Smullyan, Theory of Formal Systems, Princeton University Press, Princeton, NJ, 1961.
23. L. Valiant, Theory of the learnable, Commun. ACM 27 (1984) 1134-1142.
24. K. Wright, Identification of unions of languages drawn from an identifiable class, in: Proc. 2nd Ann. ACM Workshop on Computational Learning Theory, 1989, pp. 328-333.
25. M. Yamaguchi, S. Shimozono, T. Shinohara, Finding minimal multiple generalization over regular patterns with alphabet indexing, in: Proc. 7th Workshop on Genome Informatics, 1996, pp. 51-60.