Learning regular sets from queries and counterexamples
Information and Computation
Negative Results for Equivalence Queries
Machine Learning
Learning k-term DNF formulas with an incomplete membership oracle
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
Inference of finite automata using homing sequences
Information and Computation
On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Learning with queries but incomplete information (extended abstract)
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
Machine Learning - Special issue on computational learning theory
An introduction to computational learning theory
An introduction to computational learning theory
A simple algorithm for learning O(log n)-term DNF
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Simple learning algorithms using divide and conquer
Computational Complexity
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
Machine Learning
Machine Learning
A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership Queries
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
On the applications of multiplicity automata in learning
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
How Many Missing Answers Can Be Tolerated by Query Learners?
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
This paper gives an "efficient" algorithm for learning deterministic finite automata by using an equivalence oracle and an incomplete membership oracle. This solves an open problem that was posed by Angluin and Slonim in 94.