Abstract
We introduce the embedding normal form for eNCE graph grammars to simplify the analysis of eNCE graph languages. Using this normal form we show that for a large class of eNCE graph grammars useless edges and blocking edges can be removed. This class of eNCE graph grammars can be characterized in terms of weak notions of order independency.
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.
