Some Decidability Results on Grammatical Inference and Complexity
暂无分享,去创建一个
[1] Alan W. Biermann,et al. On the Inference of Turing Machines from Sample Computations , 1972, Artif. Intell..
[2] Stefano Crespi-Reghizzi,et al. Reduction of Enumeration in Grammar Acquisition , 1971, International Joint Conference on Artificial Intelligence.
[3] Juris Hartmanis,et al. An Overview of the Theory of Computational Complexity , 1971, JACM.
[4] David Pager. On the Efficiency of Algorithms , 1970, JACM.
[5] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[6] Paul R. Young,et al. Toward a Theory of Enumerations , 1968, JACM.
[7] James Jay Horning,et al. A study of grammatical inference , 1969 .
[8] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[9] A. C. Shaw,et al. Linguistic methods in picture processing: a survey , 1899, AFIPS Fall Joint Computing Conference.
[10] Thomas G. Evans,et al. A grammar-controlled pattern analyzer , 1968, IFIP Congress.
[11] Manuel Blum. On the Size of Machines , 1967, Inf. Control..
[12] Joshua Lederberg,et al. Mechanization of inductive inference in organic chemistry. , 1967 .
[13] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[14] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[15] G. Miller. The Psychology Of Communication , 1967 .
[16] E. Mark Gold,et al. Limiting recursion , 1965, Journal of Symbolic Logic.
[17] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[18] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..
[19] Eli Shamir,et al. A Remark on Discovery Algorithms for Grammars , 1962, Inf. Control..
[20] Michael Satosi Watanabe,et al. Information-Theoretical Aspects of Inductive and Deductive Inference , 1960, IBM J. Res. Dev..