Abstract
eNCE (edge label neighborhood controlled) graph grammars belong to the most powerful graph rewriting systems with single-node graphs on the left-hand side of the productions. From an algorithmic point of view, confluent and boundary eNCE graph grammars are the most interesting subclasses of eNCE graph grammars. In confluent eNCE graph grammars, the order in which nonterminal nodes are substituted is irrelevant for the resulting graph. In boundary eNCE graph grammars, nonterminal nodes are never adjacent. In this paper, we show that given a confluent or boundary eNCE graph grammar G, the problem whether the language L(G) defined by G is empty, is DEXPTIME-complete.
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 callSimilar Papers
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.
