Author:
Helmbold David,Sloan Robert,Warmuth Manfred K.
Reference21 articles.
1. Polynomial learnability of semilinear sets;Abe,1989
2. Naoki Abe Learning commutative deterministic finite state automata in polynomial time. 1990. To appear in the First International Workshop on Algorithmic Learning Theory, ALT90.
3. Queries and concept learning;Angluin;Machine Learning,1987
4. Dana Angluin Equivalence queries and approximate fingerprints. Machine Learning, 1990. Special issue for COLT 89, to appear. A preliminary version is available in Second Workshop on Computational Learning Theory, pages 134–145, 1989.
5. On the prediction of general recursive functions;Barzdin;Soviet Mathematics Doklady,1972
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献