Author:
Parekh Rajesh,Honavar Vasant
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75, 87–106 (1987)
2. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
3. Castro, J., Guijarro, D.: Query, PACS and simple-PAC learning. Technical Report LSI-98-2-R, Universitat Polytéctica de Catalunya, Spain (1998)
4. Denis, F., D’Halluin, C., Gilleron, R.: Pac learning with simple examples. In: STACS 1996 - Proceedings of the 13th Annual Symposium on the Theoretical Aspectsof Computer Science, pp. 231–242 (1996)
5. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302–320 (1978)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings;Grammatical Inference: Algorithms and Applications;2008
2. Polynomial Distinguishability of Timed Automata;Grammatical Inference: Algorithms and Applications;2008
3. Ten Open Problems in Grammatical Inference;Grammatical Inference: Algorithms and Applications;2006
4. PAC Learning under Helpful Distributions;RAIRO - Theoretical Informatics and Applications;2001-03
5. Inference of ω-Languages from Prefixes;Lecture Notes in Computer Science;2001