Learning of R.E. languages from good examples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1316, Issue , 1997, Pages 32-47

  Jain, Sanjay ^a   Lange, Steffen ^b   Nessel, Jochen ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF LEIPZIG   (Germany)

^c University of Koblenz Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

IDENTIFICATION CRITERION; INDEXED FAMILIES; RECURSIVE LANGUAGES; RECURSIVELY ENUMERABLE LANGUAGES;

COMPUTATIONAL LINGUISTICS;

EID: 84958058400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_34     Document Type: Conference Paper

References (19)

1. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980
2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
3. G. Baliga, J. Case, and S. Jain. Language learning with some negative information. Journal of Computer and System Sciences, 51(5):273-285, 1995.
4. M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322-336, 1967.
5. L. Blum, and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
6. J. Case and S. Jain and S. Lange and T. Zeugmann. Incremental concept learning for bounded data mining. DOI Technical Report, DOI-TR-136, Kyushu University, Japan, 1997.
7. J. Case and C. Lynes. Machine inductive inference and language identification. In Proc. ICALP'92, pages 107-115, LNCS 140, Springer-Verlag, 1982.
8. J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193-220, 1983.
9. S. Jain and S. Lange and J. Nessel. On the learnability of recursively enumerable languages from good examples. Technical Report, LSA-97-04E, University Kaiserslautern, Germany, 1997.
10. D. de Jongh and M. Kanazawa. Angluin's theorem for indexed families of r.e. sets and applications. In Proc. COLT'96, pages 193-203, ACM Press, 1996.
11. R. Freivalds, E. B. Kinber, and R. Wiehagen. On the power of inductive inference from good examples. Theoretical Computer Science, 110:131-144, 1993.
12. M. A. Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85:1-11, 1990.
13. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
14. S. A. Goldman and H. D. Mathias. Teaching a smarter learner. Journal of Computer and System Sciences, 52:255-267, 1996.
15. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley PuMishing Company, 1979.
16. S. Jain and A. Sharma. Elementary formal systems, intrinsic complexity and procrastination. Information and Computation, 132:65-84, 1997.
17. S. Lange, J. Nessel, and R. Wiehagen. Language learning from good examples. In Proc. ALT'94, pages 423-437, LNAI 872, Springer-Verlag, 1994.
18. H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Reprinted by MtT Press, Cambridge, Massachusetts in 1987.
19. T. Zeugmann mad S. Lange. A guided tour across the boundaries of learning recursive languages. In Algorithmic Learning for Knowledge-Based Systems, pages 190-258, LNAI 961, Springer-Verlag, 1995.