Pure grammars and pure languages†
Armen Gabrielian · International Journal of Computer Mathematics · 1981
The notion of “pure grammar” is introduced as a semi-Thue system with no non-terminals. The basic properties of pure grammars and the “pure languages” that they generate are investigated. Other topics introduced are “definite Turing machines” that accept pure languages, pure parallel languages, pure relations and pure Post canonical systems.