Abstract
The concept of cooperation and distribution as known from the area of grammar systems is introduced to graph grammars; more precisely, to hyperedge replacement (for short, HR) grammars. This can be seen as a modest approach to controlled HR. Two different derivation modes are considered, the so-called t-mode and the =k-mode. For the t-mode it is shown that the class of hypergraph languages obtained is equal to the class of ET0L HR languages which is a natural generalization of the class of ET0L languages to hypergraphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.