Abstract
We consider the complexity of the emptiness problem for various classes of graph languages defined by eNCE (edge label neighborhood controlled embedding) graph grammars. In particular, we show that the emptiness problem is undecidable for general eNCE graph grammars, DEXPTIME-complete for confluent and boundary eNCE graph grammars, PSPACE-complete for linear eNCE graph grammars, NL-complete for deterministic confluent, deterministic boundary, and deterministic linear eNCE graph grammars. The exponential time algorithm for deciding emptiness of confluent eNCE graph grammars is based on an exponential time transformation of a confluent eNCE graph grammar into a nonblocking confluent eNCE graph grammar generating the same language.
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.
