On the learnability of recursively enumerable languages from good examples

Theoretical Computer Science

Volumn 261, Issue 1, 2001, Pages 3-29

  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

Computational learning theory; Good examples; Inductive inference

Indexed keywords

FINITE AUTOMATA; LEARNING SYSTEMS; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS;

COMPUTATIONAL LEARNING THEORY;

FORMAL LANGUAGES;

EID: 0034915812     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00131-6     Document Type: Conference Paper

References (21)

1. Finding patterns common to a set of strings
2. Inductive inference of formal languages from positive data
3. Language learning with some negative information
4. A machine independent theory of the complexity of recursive functions
5. Toward a mathematical theory of inductive inference
6. Incremental concept learning for bounded data mining
7. Machine inductive inference and language identification
8. Comparison of identification criteria for machine inductive inference
9. Angluin's theorem for indexed families of r.e. sets and applications
10. On the power of inductive inference from good examples
11. Prudence and other conditions on formal language learning
12. Language identification in the limit
13. Teaching a smarter learner
14. Elementary formal systems, intrinsic complexity and procrastination
15. Learning recursive languages from good examples
16. Inductive inference from all positive and some negative data
17. Teachability in computational learning
18. Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
19. A guided tour across the boundaries of learning recursive languages