Abstract
The main result of this paper is that a regular-based transformational grammar which meets the condition on recoverability of deletions and which uses filter and postcyclic transformations can generate any recursively enumerable language. From this follows immediately that context free or context sensitive based transformational grammars which meet the condition on recoverability of deletions and which use filter and postcyclic transformations can generate any recursively enumerable language. These problems are investigated with a view to their implications for the current framework of transformational theory of grammars of natural languages.
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 callSimilar Papers
More From: Information and Control
Disclaimer: 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.
