GRAMMARS REDUCING THE GENERATIVE POWER

Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages. It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a general decision procedure for all languages generated under such a restriction) or too strong (in the sense that there exists a recursive language that cannot be generated by any transformational grammar thus restricted). In addition, some related prob- lems will be discussed.