Author:
Ouchi Seishi,Okayama Tomohiko,Otaki Keisuke,Yoshinaka Ryo,Yamamoto Akihiro
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference22 articles.
1. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46–62 (1980)
2. Angluin, D.: Inductive inference of formal languages from positive data. Inf. Control. 45(2), 117–135 (1980)
3. Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741–765 (1982)
4. Arimura, H., Shinohara, T., Otsuki, S.: A polynomial time algorithm for finding finite unions of tree pattern languages. In: Proceedings of the Second Internaitonal Workshop on Nonmonotonic and Inductive Logic, LNAI 659, pp. 118–131. Springer (1993)
5. Arimura, H, Shinohara, T, Otsuki, S: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In: Enjalbert, P., Mayr, E., Wagner, K. (eds.) STACS 94, Lecture Notes in Computer Science, vol. 775, pp. 647–660. Springer, Berlin (1994)