1. D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. Technical report, Report No. UCB/CSD 89/528, Computer Science Division, University of California Berkeley, 1989. To appear, J. ACM.
2. D. Angluin and Michael Kharitonov. When won't membership queries help? To appear at STOC '91, 1990.
3. Learning regular sets from queries and counterexamples;Angluin;Information and Computation,1987
4. Howard Aizenstein and Leonard Pitt. Exact learning of read-twice dnf formulas. Unpublished Manuscript, 1991.
5. Yoav Freund. Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990.