1. Angluin, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, 117–135.
2. Baliga, G., Case, J., and Jain, S. (1996), Synthesizing enumeration techniques for language learning, eCOLT, eC-TR-96-003.
3. Blum, M. (1967), A machine-independent theory of the complexity of recursive functions, Journal of the ACM 14, 322–336.
4. Freivalds, R., Karpinski, M., and Smith, C.H. (1994), Co-learning of total recursive functions, in “Proc. 7th Annual ACM Conference on Computational Learning Theory,” pp. 190–197, ACM Press, New York.
5. Freivalds, R., Gobleja, D., Karpinski, M., and Smith, C.H. (1994), Colearnability and FIN-identifiability of enumerable classes of total recursive functions, in “Proc. 4th Int. Workshop on Analogical and Inductive Inference, AII'94,” LNAI Vol. 872, pp. 100–105, Springer-Verlag, Berlin.