1. Inductive inference of formal languages from positive data;Angluin;Information and Control,1980
2. G. Baliga, J. Case, W. Merkle, F. Stephan, R. Wiehagen, When unlearning helps, Technical Report TRA5/06, School of Computing, National University of Singapore, 2005, Preliminary version appeared as “Unlearning helps”, by, G. Baliga, J. Case, W. Merkle, F. Stephan, in Proceedings of the 27th International Colloquium on Automata, Languages and Programming—ICALP 2000, Springer Lecture Notes in Computer Science, vol. 1853, 2000, pp. 844–855.
3. Inductive inference of automata, functions and programs;Bārzdiņš;International Mathematical Congress, Vancouver,1974
4. A machine independent theory of the complexity of the recursive functions;Blum;Journal of the Association for Computing Machinery,1967
5. T.G.R. Bower, Concepts of development, in: Proceedings of the 21st International Congress of Psychology, Presses Universitaires de France, 1978, pp. 79–97.