| Angluin, Finding patterns common to a set of strings, 1980 | :: | 2 |
| Blum,Blum, Toward a mathematical theory of inductive inference, 1975 | :: | 1 |
| Daley,Kalyanasundaram,Velauthapillai, Breaking the probability 1/2 barrier in fin-type learning, 1992 | :: | 1 |
| Daley,Pitt,Velauthapillai,Will, Relations between probabilistic and team one-shot learners, 1991 | :: | 1 |
| Gold, Language identification in the limit, 1967 | :: | 54 |
| Hopcroft,Ullman, Introduction to Automata Theory Languages and Computation, 1979 | :: | 15 |
| Jain,Sharma,Velauthapillai, Finite identification of function by teams with success ratio 1/2 and above, 1995 | :: | 1 |
| Jain,Sharma, Language learning by a team, 1990 | :: | 1 |
| Jain,Sharma, Finite learning by a team, 1990 | :: | 1 |
| Jain,Sharma, Computational limits on team identification of languages, 1993 | :: | 1 |
| Jain,Sharma, Probability is more powerful than team for language identification, 1993 | :: | 1 |
| Jain,Sharma, On aggregating teams of learning machines, 1995 | :: | 1 |
| Osherson,Stob,Weinstein, Aggregating inductive expertise, 1986 | :: | 1 |
| Osherson,Stob,Weinstein, Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists, 1986 | :: | 2 |
| Pitt,Smith, Probability and plurality for aggregations of learning machines, 1988 | :: | 1 |
| Pitt, Probabilistic inductive inference, 1989 | :: | 2 |
| Smith, The power of pluralism for automatic program synthesis, 1982 | :: | 1 |