Abstract
In this paper we define graph grammars, called the node-replacement graph grammars with path-controlled embedding (nPCE grammars), which use a sequence of edges instead of a single edge to embed a newly replaced graph into the host graph. Then we show that there exists a class of nPCE grammars generating a class of graph languages which is equal to the class of context-free array languages under some stipulations. It means that the path-controlled embedding brings no significant contexts into the production rules. Then, we characterize the above-mentioned class of nPCE grammars by making use of the partial path group.
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.
