Grammatical complexity and inference
暂无分享,去创建一个
S. Reder | J. Feldman | J. Gips | J. Horning
[1] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .
[2] Eli Shamir,et al. A Remark on Discovery Algorithms for Grammars , 1962, Inf. Control..
[3] M. Aizerman,et al. Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning , 1964 .
[4] E. Mark Gold,et al. Limiting recursion , 1965, Journal of Symbolic Logic.
[5] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.
[6] Michael A. Harrison,et al. Introduction to switching and automata theory , 1965 .
[7] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[8] Patrick Suppes. Concept Formation and Bayesian Decisions , 1966 .
[9] Philip J. Stone,et al. Experiments in induction , 1966 .
[10] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[11] A. C. Shaw,et al. Linguistic methods in picture processing: a survey , 1899, AFIPS Fall Joint Computing Conference.
[12] B. Ripley,et al. Pattern Recognition , 1968, Nature.
[13] Juris Hartmanis. Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.