Replacing Limit Learners with Equally Powerful One-Shot Query Learners
暂无分享,去创建一个
[1] John Case,et al. Machine Inductive Inference and Language Identification , 1982, ICALP.
[2] Steffen Lange,et al. Algorithmic Learning for Knowledge-Based Systems , 1995, Lecture Notes in Computer Science.
[3] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[5] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[6] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[7] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.
[8] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[9] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[10] Dana Angluin. Queries revisited , 2004, Theor. Comput. Sci..
[11] Thomas Zeugmann,et al. A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.
[12] John Case,et al. The Synthesis of Language Learners , 1999, Inf. Comput..
[13] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[14] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[15] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[16] Sandra Zilles,et al. On the Learnability of Erasing Pattern Languages in the Query Model , 2003, ALT.
[17] Thomas Zeugmann,et al. Language learning in dependence on the space of hypotheses , 1993, COLT '93.