Gold-Style and Query Learning Under Various Constraints on the Target Class
暂无分享,去创建一个
[1] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[2] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[3] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..
[4] Sandra Zilles,et al. Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space , 2004, ALT.
[5] Manuel Blum,et al. Inductive inference and unsolvability , 1991, Journal of Symbolic Logic.
[6] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[7] Thomas Zeugmann,et al. A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.
[8] John Case,et al. Machine Inductive Inference and Language Identification , 1982, ICALP.
[9] Dana Angluin,et al. Queries revisited , 2001, Theoretical Computer Science.
[10] Sandra Zilles,et al. Replacing Limit Learners with Equally Powerful One-Shot Query Learners , 2004, COLT.
[11] Sandra Zilles,et al. Relations between Gold-style learning and query learning , 2005, Inf. Comput..
[12] Sanjay Jain,et al. Learning Languages from Positive Data and Negative Counterexamples , 2004, ALT.
[13] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[14] Dick de Jongh,et al. Angluin's theorem for indexed families of r.e. sets and applications , 1996, COLT '96.
[15] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[16] Thomas Zeugmann,et al. Language learning in dependence on the space of hypotheses , 1993, COLT '93.
[17] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[18] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .