Set-driven and rearrangement-independent learning of recursive languages

Theory of Computing Systems

Volumn 29, Issue 6, 1996, Pages 599-634

  Lange, S ^a   Zeugmann, T ^b  

^a LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

CONSERVATIVE LEARNING; HYPOTHESIS SPACE; INDEPENDENT LEARNING; INDEXED FAMILIES; LEARNING MODELS; MONOTONIC LEARNING; RECURSIVE LANGUAGES; SET-DRIVEN LEARNING;

LEARNING SYSTEMS;

EID: 0000625347     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01301967     Document Type: Article

References (18)

1. D. Angluin, Finding patterns common to a set of strings, Journal of Computer and System Sciences, 21 (1980), 46-62.
2. D. Angluin, Inductive inference of formal languages from positive data. Information and Control, 45 (1980), 117-135.
3. R. Berwick, The Acquisition of Syntactic Knowledge, MIT Press, Cambridge, MA, 1985.
4. L. Blum and M. Blum, Toward a mathematical theory of inductive inference. Information and Control, 28 (1975), 122-155.
5. M. Fulk, Prudence and other restrictions in formal language learning. Information and Computation, 85 (1990), 1-11.
6. E. M. Gold, Language identification in the limit, Information and Control, 10 (1967), 447-474.
7. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, MA, 1969.
8. K. P. Jantke, Monotonic and non-monotonic inductive inference, New Generation Computing, 8(1991), 349-360.
9. S. Lange and R. Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing, 8 (1991), 361-370.
10. S. Lange and T. Zeugmann, Types of monotonic language learning and their characterization, Proc. 5th Annual ACM Workshop on Computational Learning Theory, ACM Press, New York, 1992, pp. 377-390.
11. S. Lange and T. Zeugmann, Monotonic versus non-monotonic language learning, Proc. 2nd International Workshop on Nonmonotonic and Inductive Logic (G. Brewka, K. P. Jantke, and P. H. Schmitt, Eds.), Springer-Verlag, Berlin, 1993, Lecture Notes in Artificial Intelligence, Vol. 659, pp. 254-269.
12. S. Lange and T. Zeugmann, Language learning in dependence on the space of hypotheses, Proc. 6th Annual ACM Conference on Computational Learning Theory, ACM Press, New York, 1993, pp. 127-136.
13. S. Lange and T. Zeugmann, The leamability of recursive languages in dependence on the hypothesis space, GOSLER-Report 20/93, FB Mathematik, Informatik und Naturwissenschaften, HTWK Leipzig, 1993.
14. S. Lange and T. Zeugmann, Learning recursive languages with bounded mind changes, International Journal of Foundations of Computer Science, 4 (1993), 157-178.
15. S. Lange and T. Zeugmann, Characterization of language learning from informant under various monotonicity constraints, Journal of Experimental and Theoretical Artificial Intelligence, 6 (1994), 71-94.
16. S. Lange, T. Zeugmann, and S. Kapur, Monotonic and dual-monotonic language learning, Theoretical Computer Science, 155 (1996), 365-410.
17. M. Machtey and P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978.
18. Y. Mukouchi, Inductive inference with bounded mind changes, Proc. 3rd Workshop on Algorithmic Learning Theory (S. Doshita, K. Furukawa, K. P. Jantke, and T. Nishida, Eds.), Springer-Verlag, Berlin, 1993, Lecture Notes in Artificial Intelligence, Vol. 743, pp. 125-134.