Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. V. Amar and G. Putzolu. Generalizations of regular events.Information and Control, 8:56–63, 1965.
2. D. Angluin. Learningk-bounded context-free grammars. Research Report 557, Department of Computer Science, Yale University, 1987.
3. D. Angluin. Learning regular sets from queries and counterexamples.Information and Computation, 75:87–106, 1987.
4. D. Angluin and D. N. Hoover. Regular prefix relations.Mathematical Systems Theory, 17:167–191, 1984.
5. D. Angluin and M. Kharitonov. When won't membership queries help?Proceedings of the 23ndACM Symposium on Theory of Computing, pages 444–454, 1991.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献