[1] D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46--62, 1980.

[2] L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125--155, 1975.

[3] R. P. Daley, B. Kalyanasundaram, and M. Velauthapillai. Breaking the probability 1/2 barrier in fin-type learning. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania, pages 203--217. A. C. M. Press, 1992.

[4] R. P. Daley, L. Pitt, M. Velauthapillai, and T. Will. Relations between probabilistic and team one-shot learners. In L. Valiant and M. Warmuth, editors, Proceedings of the Workshop on Computational Learning Theory, pages 228--239. Morgan Kaufmann Publishers, Inc., 1991.

[5] E. M. Gold. Language identification in the limit. Information and Control, 10:447--474, 1967.

[6] J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979.

[7] S. Jain and A. Sharma. Finite learning by a team. In M. Fulk and J. Case, editors, Proceedings of the Third Annual Workshop on Computational Learning Theory, Rochester, New York, pages 163--177. Morgan Kaufmann Publishers, Inc., August 1990.

[8] S. Jain and A. Sharma. Language learning by a team. In M. S. Paterson, editor, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pages 153-166. Springer-Verlag, July 1990. Lecture Notes in Computer Science, 443.

[9] S. Jain and A. Sharma. Computational limits on team identification of languages. Technical Report 9301, School of Computer Science and Engineering; University of New South Wales, 1993.

[10] S. Jain and A. Sharma. Probability is more powerful than team for language identification. In Proceedings of the Sixth Annual Conference on Computational Learning Theory, Santa Cruz, California, pages 192--198. ACM Press, July 1993.

[11] S. Jain and A. Sharma. On aggregating teams of learning machines. Theoretical Computer Science A, 137(1):85--108, January 1995.

[12] S. Jain, A. Sharma, and M. Velauthapillai. Finite identification of function by teams with success ratio 1/2 and above. Information and Computation, 1995. To Appear.

[13] D. Osherson, M. Stob, and S. Weinstein. Aggregating inductive expertise. Information and Control, 70:69--95, 1986.

[14] D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986.

[15] L. Pitt. Probabilistic inductive inference. Journal of the ACM, 36:383--433, 1989.

[16] L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77--92, 1988.

[17] C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144-1165, 1982.