Replacing limit learners with equally powerful one-shot query learners

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 155-169

  Lange, Steffen ^a   Zilles, Sandra ^b  

^a Fachhochschule Darmstadt   (Germany)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATABASE SYSTEMS; FORMAL LANGUAGES; INDEXING (OF INFORMATION); INFORMATION ANALYSIS; QUERY LANGUAGES; COMPUTATIONAL LINGUISTICS; GOLD;

HUMAN LEARNING; LEARNING MODELS; LIMITING PROCESSES; QUERY LEARNERS; CRUCIAL PARAMETERS; GOLD-STYLE LANGUAGE LEARNING; GOLD-STYLE LEARNING; HYPOTHESIS SPACE; LEARNING CAPABILITIES; LEARNING VIA QUERIES; QUERY LEARNING MODELS; RECURSIVE LANGUAGES;

LEARNING SYSTEMS;

EID: 9444256453     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_11     Document Type: Conference Paper

References (14)

1. D. Angluin. Inductive inference of formal languages from positive data. Inform. Control, 45:117-135, 1980.
2. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
3. D. Angluin. Queries revisited. Theoret, Comput. Sci., 313:175-194, 2004.
4. G. Baliga, J. Case, S. Jain. The synthesis of language learners. Inform. Comput., 152:16-43, 1999.
5. M. Blum. A machine-independent theory of the complexity of recursive functions. J. ACM, 14:322-336, 1967.
6. L. Blum, M. Blum. Toward a mathematical theory of inductive inference. Inform. Control, 28:125-155, 1975.
7. J. Case, C. Lynes. Machine inductive inference and language identification. In: Proc. ICALP 1982, LNCS 140, 107-115, Springer, 1982.
8. E. M. Gold. Language identification in the limit. Inform. Control, 10:447-474, 1967.
9. J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.
10. S. Lange, T. Zeugmann. Language learning in dependence on the space of hypotheses. In: Proc. COLT 1993, 127-136, ACM Press, 1993.
11. S. Lange, S. Zilles. On the learnability of erasing pattern languages in the query model. In: Proc. ALT 2003, LNAI 2842, 129-143, Springer, 2003.
12. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability, MIT Press, 1987.
13. F. Stephan. Degrees of Computing and Learning. Habilitationsschrift, Ruprecht-Karls-Universität, Heidelberg, 1999.
14. T. Zeugmann, S. Lange. A guided tour across the boundaries of learning recursive languages. In: Algorithmic Learning for Knowledge-Based Systems, LNAI 961, 190-258, Springer, 1995.