1. Angluin, D. (1987). Learning regular sets from queries and counterexamples. Information and Computation, 75, 87?106.
2. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (pp. 273?282). Berkeley, CA: The Association for Computing Machinery.
3. Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13?30.
4. Technical Report TR-03-87;M. Kearns,1987
5. Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 285?295). New York: The Association for Computing Machinery.