Abstract
Parallel communicating grammar systems are language generating devices consisting of several grammars which derive synchronously their sentential forms and communicate with each other by sending their sentential forms to another component on request. Due to collaboration, grammar systems with context-free components are more powerful than a single context-free grammar; they even can generate all recursively enumerable languages. In natural languages, there occur constructions that cannot be modelled by context-free languages. Three important phenomena are the so-called multiple agreements, crossed agreements and replication which are represented by the three non-context-free languages K1 = { anbncn | n ≥ 1 }, K2 = { anbmcndm | m ≥ 1, n ≥ 1 }, and K3 = { ww | w ∈ { a, b }+}, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar systems) that are context-free and that generate the language K2, working in different modes. In two cases, the results are optimal.
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 callMore From: International Journal of Foundations of Computer Science
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.
