#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

T generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars.

Answer

Type-0 grammars