Abstract
Recently the general theory of graph grammars has become a growing area of research. Some properties which hold for all sequential, vertex-replacing graph grammars (without erasing) are presented, including a vertex pumping lemma. A construction is described which proves the undecidability of the question whether a graph grammar has the following property: changing the order of application of the productions in a derivation does not change the graph produced. Classes of graph grammars for which this property can be decided are presented. They include the NLC graph grammars of Janssens and Rozenberg [4,5].
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.
