Learning languages from positive data and a limited number of short counterexamples
暂无分享,去创建一个
[1] John Case,et al. Language Learning with Some Negative Information , 1993, Journal of computer and system sciences (Print).
[2] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..
[3] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[4] 元木 達也. INDUCTIVE INFERENCE FROM ALL POSITIVE AND SOME NEGATIVE DATA , 1991 .
[5] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[6] W. Gasarch,et al. Bounded Queries in Recursion Theory , 1998 .
[7] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[8] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[9] Thomas Zeugmann,et al. A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.
[10] John Case,et al. Machine Inductive Inference and Language Identification , 1982, ICALP.
[11] Sandra Zilles,et al. Replacing Limit Learners with Equally Powerful One-Shot Query Learners , 2004, COLT.
[12] Daniel N. Osherson,et al. Criteria of Language Learning , 1982, Inf. Control..
[13] Mark A. Fulk. Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..
[14] Sanjay Jain,et al. Learning Languages from Positive Data and Negative Counterexamples , 2004, ALT.
[15] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[16] Sandra Zilles,et al. Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space , 2004, ALT.
[17] Rolf Wiehagen,et al. Ignoring data may be the only way to learn efficiently , 1994, J. Exp. Theor. Artif. Intell..