Learning recursive languages from good examples

Annals of Mathematics and Artificial Intelligence

Volumn 23, Issue 1-2, 1998, Pages 27-52

  Lange, Steffen ^a   Nessel, Jochen ^b   Wiehagen, Rolf ^b  

^a LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032334223     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018955906119     Document Type: Article

References (17)

1. D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117-135.
2. G. Baliga, J. Case and S. Jain, Language learning with some negative information, in: Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 665 (Springer, Berlin, 1993) pp. 672-681.
3. M. Blum, A machine-independent theory of the complexity of recursive functions, Journal of the Association for Computing Machinery 14 (1967) 322-336.
4. Yu.L. Eršov, Theory of Numberings (Nauka, Moscow, 1977) (in Russian).
5. R. Freivalds, E.B. Kinber and R. Wiehagen, Inductive inference from good examples, in: Proc. 2nd Intern. Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 397 (Springer, Berlin, 1989) pp. 1-17.
6. R. Freivalds, E.B. Kinber and R. Wiehagen, On the power of inductive inference from good examples, Theoretical Computer Science 110 (1993) 131-144.
7. R. Friedberg, Three theorems on recursive enumeration, Journal of Symbolic Logic 23 (1958) 309-316.
8. E.M. Gold, Language identification in the limit, Information and Control 10 (1967) 447-474.
9. S.A. Goldman and H.D. Mathias, Teaching a smarter learner, in: Proc. 6th Annual ACM Conference on Computational Learning Theory (ACM Press, New York, 1993) pp. 67-76.
10. J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata (Addison-Wesley, Reading, MA, 1969).
11. S. Lange and R. Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8 (1991) 361-370.
12. S. Lange and 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.
13. T. Motoki, Inductive inference from all positive and some negative data, Information Processing Letters 39 (1991) 177-182.
14. D. Osherson, M. Stob and S. Weinstein, Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists (MIT Press, Cambridge, MA, 1986).
15. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability (MIT Press, Cambridge, MA, 1987).
16. A. Shinohara and S. Miyano, Teachability in computational learning, New Generation Computing 8 (1991) 337-347.
17. R. Wiehagen, From inductive inference to algorithmic learning theory, New Generation Computing 12 (1994) 321-335.