A polynomial time algorithm for finding finite unions of tree pattern languages-Reference-Cited by-同舟云学术

A polynomial time algorithm for finding finite unions of tree pattern languages

Published: Issue: Volume: Page:118-131
ISSN:
Container-title:Nonmonotonic and Inductive Logic
language:
Short-container-title:

Author:

Arimura Hiroki,Shinohara Takeshi,Otsuki Setsuko

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0030389.pdf

Reference15 articles.

1. D. Angluin. Finding common patterns to a set of strings. In Proceedings of the 11th Annual Symposium on Theory of Computing, pp. 130–141, 1979.

2. D. Angluin. Finding common patterns to a set of strings. Journal of Computer and System Sciences, Vol. 21, pp. 46–62, 1980.

3. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, Vol. 45, pp. 117–135, 1980.

4. H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time inference of unions of tree pattern languages. In Proceedings of the Second Workshop on Algorithmic Learning Theory, pp. 105–114, 1991. to appear in IEICE trans. Inf. & Syst, 1992, printed in Japan.

5. K.P. Jantke and H-R. Beick. Combining postulates of naturalness in inductive inference. Elektron. Informationsverarb. Kybern., Vol. 17, pp. 465–484, 1981.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning Tree Languages;Topics in Grammatical Inference;2016

2. Learning concepts and their unions from positive data with refinement operators;Annals of Mathematics and Artificial Intelligence;2015-05-27

3. Learning from Positive Data Based on the MINL Strategy with Refinement Operators;New Frontiers in Artificial Intelligence;2010

4. Evolution of Multiple Tree Structured Patterns from Tree-Structured Data Using Clustering;AI 2008: Advances in Artificial Intelligence;2008

5. Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses;Grammatical Inference: Algorithms and Applications;2006