Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Angluin, D.; Inductive Inference of Formal Languages from Positive Data, Information and Control 45, 117–135 (1980).
2. Barzdins, J.; Two Theorems on the Limiting Synthesis of Functions, Theory of Algorithms and Programs, Latvian State University, Riga 210, 82–88 (1974) (in Russian).
3. Barzdins, J.; Inductive Inference of Automata, Functions and Programs, In: Proceedings International Congress of Math., Vancouver, 455–460 (1974).
4. Baliga, G.; Case, J.; Jain, S.; Synthesizing Enumeration Techniques for Language Learning, In: Proceedings of the Ninth Annual Conference on Computational Learning Theory, ACM Press, 169–180 (1996).
5. Case, J.; Smith, C.; Comparison of Identification Criteria for Machine Inductive Inference, Theoretical Computer Science 25, 193–220 (1983).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Increasing the power of uniform inductive learners;Journal of Computer and System Sciences;2005-06
2. Intrinsic Complexity of Uniform Learning;Lecture Notes in Computer Science;2003