Author:
Parekh Rajesh,Honavar Vasant
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Angluin, D. (1981). A Note on the Number of Queries Needed to Identify Regular Languages. Information and Control, 51, 76–87.
2. Angluin, D. (1987). Learning Regular Sets from Queries and Counterexamples. Information and Computation, 75, 87-106.
3. Chomsky, N. (1956). Three Models for the Description of Language. PGIT, 2(3), 113–124.
4. Denis, F., D'Halluin, C., & Gilleron, R. (1996). PAC Learning with Simple Examples. STACS'96 — Proceedings of the 13th Annual Symposium on the Theoretical Aspects of Computer Science, 231–242.
5. Dupont, P. (1996a). Incremental Regular Inference. Pages 222–237 of: Miclet, L., & Higuera, C. (eds), Proceedings of the Third ICGI-96, Lecture Notes in Artificial Intelligence 1147. Montpellier, France: Springer.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献