Learning languages and functions by erasing

Theoretical Computer Science

Volumn 241, Issue 1-2, 2000, Pages 143-189

  Jain, Sanjay ^a   Kinber, Efim ^b   Lange, Steffen ^c   Wiehagen, Rolf ^d   Zeugmann, Thomas ^e  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SACRED HEART UNIVERSITY   (United States)

^c UNIVERSITY OF LEIPZIG   (Germany)

^d France   (Germany)

^e KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347338028     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00269-8     Document Type: Article

References (35)

1. D. Angluin, Inductive inference of formal languages from positive data, Inform. Control 45 (1980) 117-135.
2. G. Baliga, J. Case, S. Jain, Synthesizing enumeration techniques for language learning, in: Proc. 9th Annual ACM Conf. on Computational Learning Theory, ACM Press, New York, 1996, pp. 169-180.
3. L. Blum, M. Blum, Toward a mathematical theory of inductive inference, Inform. Control 28 (1975) 125-155.
4. M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM 14 (1967) 322-336.
5. J. Case, C.H. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25 (1983) 193-220.
6. R. Freivalds, Minimal Gödel numbers and their identification in the limit, in: Proc. Int. Conf. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 32, Springer, Berlin, 1975, pp. 219-225.
7. R. Freivalds, Inductive inference of minimal programs, in: Proc. 3rd Annual Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, 1990, pp. 3-20.
8. R. Freivalds, Inductive inference of recursive functions: qualitative theory, in: Baltic Computer Science, Lecture Notes in Computer Science, vol. 502, Springer, Berlin, 1991, pp. 77-110.
9. R. Freivalds, S. Jain, Kolmogorov numberings and minimal identification, in: Proc. 2nd European Conf. on Computational Learning Theory, Lecture Notes in Artificial Intelligence, vol. 904, Springer, Berlin, 1995, pp. 182-195.
10. R. Freivalds, M. Karpinski, C.H. Smith, Co-learning of total recursive functions, in: Proc. 7th Annual Conf. on Computational Learning Theory, ACM Press, New York, 1994, pp. 190-197.
11. R. Freivalds, D. Gobleja, M. Karpinski, C.H. Smith, Co-learnability and FIN-identifiability of enumerable classes of total recursive functions, in: Proc. 4th International Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, vol. 872, Springer, Berlin, 1994, pp. 100-105.
12. R. Freivalds, E.B. Kinber, R. Wiehagen, How inductive inference strategies discover their errors, Inform. Comput. 118 (1995) 208-226.
13. R. Freivalds, T. Zeugmann, Co-learning of recursive languages from positive data, in: Proc. Perspectives of System Informatics, 2nd Int. Andrei Ershov Memorial Conf., Lecture Notes in Computer Science, vol. 1181, Springer, Berlin, 1996, pp. 122-133.
14. E.M. Gold, Language identification in the limit, Inform. Control 10 (1967) 447-474.
15. S. Jain, An infinite class of functions identifiable using minimal programs in all Kolmogorov numberings, Int. J. Found. Comput. Sci. 6 (1995) 89-94.
16. S. Jain, E. Kinber, R. Wiehagen, On learning and co-learning of minimal programs, Technical Report LSA-96-06E, Centre for Learning Systems and Applications, Department of Computer Science, University of Kaiserslautern, 1996.
17. S. Jain, A. Sharma, Characterizing language learning by standardizing operations, J. Comput. System Sci. 49 (1994) 96-107.
18. S. Kapur, G. Bilardi, Language learning without overgeneralization, Theoret. Comput. Sci. 141 (1995) 151-162.
19. R. Klette, R. Wiehagen, Research in the theory of inductive inference by GDR mathematicians - a survey, Inform. Sciences 22 (1980) 149-169.
20. M. Kummer, A learning-theoretic characterization of classes of recursive functions, Inform. Process. Lett. 54 (1995) 205-211.
21. S. Lange, R. Wiehagen, T. Zeugmann, Learning by erasing, Technical Report RIFIS-TR-CS-122, Research Institute of Fundamental Information Science, Kyushu University, 1996.
22. S. Lange, T. Zeugmann, Types of monotonic language learning and their characterization, in: Proc. 5th Annual ACM Workshop on Computational Learning Theory, ACM Press, New York, 1992, pp. 377-390.
23. S. Lange, T. Zeugmann, Monotonic versus non-monotonic language learning, in: Proc. 2nd Int. Workshop on Nonmonotonic and Inductive Logic, December 1991, Lecture Notes in Artificial Intelligence, vol. 659, Springer, Berlin, 1993, pp. 254-269.
24. S. Lange, T. Zeugmann, Language learning in dependence on the space of hypotheses, in: Proc. 6th Annual ACM Conf. on Computational Learning Theory, ACM Press, New York, 1993, pp. 127-136.
25. S. Lange, T. Zeugmann, Learning recursive languages with bounded mind changes, Int. J. Found. Comput. Sci. 4 (1993) 157-178.
26. S. Lange, T. Zeugmann, Characterization of language learning from informant under various monotonicity constraints, J. Exp. Theoret. Artificial Intell. 6 (1994) 73-94.
27. D. Osherson, M. Stob, S. Weinstein, Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists, MIT Press, Cambridge, MA, 1986.
28. H. Rogers, Theory of Recursive Functions and Effective Computability McGraw-Hill, New York, 1967, Reprinted, MIT Press, Cambridge, MA, 1987.
29. M. Sato, K. Umayahara, Inductive inferability for formal languages from positive data, IEICE Trans. Inform. Systems E-75D (1992) 415-419.
30. V.L. Selivanov, Enumerations of families of general recursive functions, Algebra i Logika 15 (1976) 205-226; English Translation, Algebra and Logic 15 (1976) 128-141.
31. V.L. Selivanov, Enumerations of families of general recursive functions, Algebra i Logika 15 (1976) 205-226; English Translation, Algebra and Logic 15 (1976) 128-141.
32. B.A. Trakhtenbrot, Ya.M. Barzdin, Finite Automata - Behavior and Synthesis, Fundamental Studies in Computer Science, vol. 1, North-Holland, Amsterdam, 1973.
33. R. Wiehagen, Characterization problems in the theory of inductive inference, in: Proc. Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 62, Springer, Berlin, 1978, pp. 494-508.
34. T. Zeugmann, S. Lange, A guided tour across the boundaries of learning recursive languages, in: Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence, vol. 961, Springer, Berlin, 1995, pp. 190-258.
35. T. Zeugmann, S. Lange, S. Kapur, Characterizations of monotonic and dual monotonic language learning, Inform. Comput. 120 (1995) 155-173.