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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
