Learning recursive languages from good examples
暂无分享,去创建一个
[1] Dana Angluin,et al. Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..
[2] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[3] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[4] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[5] 元木 達也. INDUCTIVE INFERENCE FROM ALL POSITIVE AND SOME NEGATIVE DATA , 1991 .
[6] Yuri L. Ershov,et al. Theory of Numberings , 1999, Handbook of Computability Theory.
[7] Richard M. Friedberg,et al. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.
[8] John Case,et al. Language Learning with Some Negative Information , 1993, Journal of computer and system sciences (Print).
[9] Sally A. Goldman,et al. Teaching a smart learner , 1993, COLT '93.
[10] Rapat Pittayanon,et al. Case #2 , 1969 .
[11] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[12] Rusins Freivalds,et al. Inductive Inference from Good Examples , 1989, AII.
[13] Sally A. Goldman,et al. Teaching a Smarter Learner , 1996, J. Comput. Syst. Sci..
[14] Daniel N. Osherson,et al. Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .
[15] Thomas Zeugmann,et al. Types of monotonic language learning and their characterization , 1992, COLT '92.
[16] Rusins Freivalds,et al. On the Power of Inductive Inference from Good Examples , 1993, Theor. Comput. Sci..