Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries-Reference-Cited by-同舟云学术

Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

Published:2007 Issue: Volume: Page:272-284
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Tîrnăucă Cristina,Knuutila Timo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-75225-7_23

Reference20 articles.

1. Angluin, D.: Finding patterns common to a set of strings (extended abstract). In: STOC 1979. Proc. 11 th Annual ACM Symposium on Theory of Computing, pp. 130–141. ACM Press, New York, NY, USA (1979)

2. Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control 51(1), 76–87 (1981)

3. Angluin, D.: Inference of reversible languages. Journal of the ACM 29(3), 741–765 (1982)

4. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

5. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)

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

1. Learning quantum finite automata with queries;Mathematical Structures in Computer Science;2023-11-30

2. How can Grammatical Inference Contribute to Computational Linguistics?;Language, Life, Limits;2014

3. Identification in the Limit of k,l-Substitutable Context-Free Languages;Grammatical Inference: Algorithms and Applications

4. A Note on the Relationship between Different Types of Correction Queries;Grammatical Inference: Algorithms and Applications