Abstract
The notion of a grammar form is extended to context-free matrix grammars yielding so-called matrix forms. Their reduction and completeness properties are studied and some normal-form results and complete matrix forms are presented. The closure properties of language families ℒ( F ) obtained from a matrix form F are also examined. The type of interpretation applied here corresponds to strict interpretations of ordinary context-free grammar forms.
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.
