1. Learning regular sets from queries and counterexamples;Angluin;Inform. and Comput.,1987
2. When won't membership queries help?;Angluin,1991
3. Learnability of recursive, non-determinate theories: Some basic results andtechniques;Frazier;Proc. 3rd Internat. Workshop on Inductive Logic Programming,1993
4. Cryptographic limitations on learning Boolean formulae and finite automata;Kearns,1989
5. Prediction-preserving reducibility;Pitt;J. Comput. System Sci.,1990