A note on the computational completeness of generalized forbidding grammars

Abstract

This paper demonstrates that a generalized forbidding grammars of degree 3, index 5, with no more than 7 conditional productions and 9 non-terminals is computationally complete This result is based on the common idea of using Geffert normal forms for type-0 grammars.