Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries-Reference-Cited by-同舟云学术

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

Published:1997 Issue: Volume: Page:260-276
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Erlebach Thomas,Rossmanith Peter,Stadtherr Hans,Steger Angelika,Zeugmann Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63577-7_48.pdf

Reference22 articles.

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

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

3. D. Angluin. Queries and concept learning. Machine Learning, 2:319–342, 1988.

4. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, and T. Zeugmann. Efficient Learning of One-Variable Pattern Languages from Positive Data. DOI-TR-128, Department of Informatics, Kyushu University, Dec. 12, 1996; http://www.i.kyushuu.ac.jp/ thomas/treport.html.

5. G. Filé. The relation of two patterns with comparable languages. In Proc. 5th Ann. Symp. Theoretical Aspects of Computer Science, LNCS 294, pp. 184–192, Berlin, 1988. Springer-Verlag.

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

1. On the Learnability of Erasing Pattern Languages in the Query Model;Lecture Notes in Computer Science;2003

2. The VC-Dimension of Subclasses of Pattern Languages;Lecture Notes in Computer Science;1999

3. On Learning Unions of Pattern Languages and Tree Patterns;Lecture Notes in Computer Science;1999

4. Learning from Random Text;Lecture Notes in Computer Science;1999

5. Finding a One-Variable Pattern from Incomplete Data;Lecture Notes in Computer Science;1998