1. Complexity theoretic results for query learning;Aizenstein;Computational Complexity,1998
2. Read-thrice DNF is hard to learn with membership and equivalence queries;Aizenstein,1992
3. D. Angluin, Learning propositional Horn sentences with hints, Technical Report YALEU/DCS/RR-590, Department of Computer Science, Yale University, New Haven, CT, 1987
4. Learning regular sets from queries and counterexamples;Angluin;Inform. Comput.,1987
5. Queries and concept learning;Angluin;Machine Learning,1988