Inductive inference of unbounded unions of pattern languages from positive data

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

Volumn 1160, Issue , 1996, Pages 257-271

  Shinohara, Takeshi ^a   Arimura, Hiroki ^b  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FINITE LANGUAGES; INDUCTIVE INFERENCE; PATTERN LANGUAGES; POSITIVE DATA; REGULAR PATTERNS; UNBOUNDED UNIONS;

ARTIFICIAL INTELLIGENCE;

EID: 84949231399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61863-5_51     Document Type: Conference Paper

References (17)

1. D. Angluin. Finding common patterns to a set of strings. In Proc. of the 11th Annual Symposium on Theory of Computing, 130-141, (1979).
2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control 45, 117-135, (1980).
3. S. Arikawa, S. Kuhara, S. Miyano, A. Shinohara, and T. Shinohara. A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains. In Proc. of the Twenty-Fifth Hawaii International Conference on System Sciences, Vol. I, 675-684, (1992).
4. S. Arikawa, S. Miyano, A. Shinohara, S. Kuhara, Y. Mukouchi, and T. Shinohara. A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Computing 11,361-375, (1993).
5. S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science 95, 97-113, (1992).
6. H. Arimura, T. Shinohara, and S. Otsuki. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In Proc. of STACS'94, LNCS 775, Springer-Verlag, 649-660, (1994).
7. E. M. Gold. Language identification in the limit. Information and Control 10, 447-474, (1967).
8. J. B. Kruskal. The theory of well-quasi-ordering: a frequently discovered concept. Journal of Combinatorial Theory (A), 13, 297-305, (1972).
9. S. Lange. private communication. (1996).
10. T. Motoki, T. Shinohara, and K. Wright. The correct definition of finite elasticity: corrigendum to identification of unions. In Proc. of the 4th Annual Workshop on Computational Learning Theory, 375, (1991).
11. T. Shinohara. Polynomial time inference of pattern languages and its applications. Proc. of the 7th IBM Symposium on Mathematical Foundations of Computer Science, 191-209, (1982).
12. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Proc. of RIMS Symposia on Software Science and Engineering, Kyoto, 1982, LNCS 147, Springer-Verlag, 115-127, (1983).
13. T. Shinohara. Inferring unions of two pattern languages. Bulletin of Informatics and Cybernetics 20, 83-88, (1983).
14. T. Shinohara. Inductive inference of monotonic formal systems from positive data. New Generation Computing 8, 371-384, (1991).
15. T. Shinohara. Rich classes inferable from positive data: lengthbounded elementary formal systems. Information and Computation 108, 175-186, (1994).
16. R. M. Smullyan. Theory of Formal Systems. Princeton University Press, Princeton, New Jersey, (1961).
17. K. Wright. Identification of unions of languages drawn from an identifiable class. In Proc. of the 2nd Annual Workshop on Computational Learning Theory, 328-333, (1989).