Pure grammars and pure languages†

†This work was supported by the National Research Council of Canada, Grant No. A-1617 and was performed while the author was a postdoctoral fellow at the University of Waterloo during 1970. It first appeared as a research report [19] in October 1970. Interest in pure grammars has been rekindled recently by the appearance of [20] and a number of other still unpublished papers

Abstract

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.

Keywords:

• Pure grammars
• post canonical systems
• pure languages

C.R. Categories:

• 5.23

†This work was supported by the National Research Council of Canada, Grant No. A-1617 and was performed while the author was a postdoctoral fellow at the University of Waterloo during 1970. It first appeared as a research report [19] in October 1970. Interest in pure grammars has been rekindled recently by the appearance of [20] and a number of other still unpublished papers

†This work was supported by the National Research Council of Canada, Grant No. A-1617 and was performed while the author was a postdoctoral fellow at the University of Waterloo during 1970. It first appeared as a research report [19] in October 1970. Interest in pure grammars has been rekindled recently by the appearance of [20] and a number of other still unpublished papers

Notes

†This work was supported by the National Research Council of Canada, Grant No. A-1617 and was performed while the author was a postdoctoral fellow at the University of Waterloo during 1970. It first appeared as a research report [19] in October 1970. Interest in pure grammars has been rekindled recently by the appearance of [20] and a number of other still unpublished papers