论文信息 - A note on the recursive enumerability of some classes of recursively enumerable languages - 字舞流文

A note on the recursive enumerability of some classes of recursively enumerable languages

Abstract An elementary proof is presented for the fact that the class of infinite recursive languages is not recursively enumerable. Its relevance for contemporary linguistics and computer science is explained.

Peter van Emde Boas | Paul M. B. Vitányi

[1] P. Stanley Peters,et al. On the generative power of transformational grammars , 1973, Inf. Sci..

[2] Lambert Meertens,et al. On restrictions on transformational grammars reducing the generative power , 1975 .

[3] J. Dekker,et al. The constructivity of maximal dual ideals in certain Boolean algebras , 1953 .

[4] Noam Chomsky,et al. वाक्यविन्यास का सैद्धान्तिक पक्ष = Aspects of the theory of syntax , 1965 .

[5] Hilary Putnam,et al. Mind, Language and Reality: Some issues in the theory of grammar , 1975 .

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[7] P. Stanley Peters,et al. On Restricting the Base Component of Transformational Grammars , 1971, Inf. Control..