Author:
Arimura Hiroki,Shinohara Takeshi,Otsuki Setsuko
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. 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 25th Hawaii International Conference on System Sciences, pp. 675–684, 1992.
2. D. Angluin. Finding patterns common to a set of strings. In Proceedings of the 11th Annual Symposium on Theory of Computing, pp. 130–141, 1979.
3. H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time inference of unions of two tree pattern languages. IEICE Trans. Inf. & Syst., E75-D, pp. 426–434, 1992.
4. H. Arimura, T. Shinohara, and S. Otsuki. A polynomial time algorithm for finding finite unions of tree pattern languages. In Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, pp. 118–131. LNAI 659, Springer, 1993.
5. S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science, Vol. 95, pp. 97–113, 1992.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献