On Learning Unions of Pattern Languages and Tree Patterns-Reference-Cited by-同舟云学术

On Learning Unions of Pattern Languages and Tree Patterns

Published:1999 Issue: Volume: Page:347-363
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Goldman Sally A.,Kwek Stephen S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46769-6_29

Reference46 articles.

1. Andris Ambainis, Sanjay Jain, and Arun Sharma. Ordinal mind change complexity of language identification. In Computational Learning Theory: Eurocolt’ 97, pages 301–315. Springer-Verlag, 1997.

2. Thomas R. Amoth, Paul Cull, and Prasad Tadepalli. Exact learning of tree patterns from queries and counterexamples. In Proc. 11th Annu. Conf. on Comput. Learning Theory, pages 175–186. ACM Press, New York, NY, 1998.

3. Thomas R. Amoth, Paul Cull, and Prasad Tadepalli. Exact learning of unordered tree patterns from queries. In Proc. 12th Annu. Conf. on Comput. Learning Theory, pages 323–332. ACM Press, New York, NY, 1999.

4. D. Angluin. Finding patterns common to a set of strings. J. of Comput. Syst. Sci., 21:46–62, 1980.

5. D. Angluin. Inductive inference of formal languages from positive data. Inform. Control, 45(2):117–135, May 1980.

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

1. Hard Optimization Problems in Learning Tree Contraction Patterns;Applied Computing and Information Technology;2014

2. Learning Unordered Tree Contraction Patterns in Polynomial Time;Inductive Logic Programming;2013

3. A bibliographical study of grammatical inference;Pattern Recognition;2005-09

4. Multi-relational Data Mining in Medical Databases;Artificial Intelligence in Medicine;2003

5. Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables;Fundamentals of Computation Theory;2001