Abstract
We investigate the generative power of cooperating distributed grammar systems with context-free rules working in the full-competence mode in combination with another derivation mode, combined sf-mode, for short. A combined sf-mode as, for example, ( sf ∧ ⩽ k ) restricts the valid derivations such that both properties have to be satisfied. If erasing rules are allowed, then except for the ( sf ∧ ⩽ 1 ) -, ( sf ∧ = 1 ) -, and ( sf ∧ t ) -modes, it is shown that the family of recursively enumerable languages is characterized. The former two exceptions characterize the family of linear context-free languages, while the latter mode describes the family of context-free languages.
Sign-in/Register to access full text options 
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.
