Abstract
Abstract The generalisation of confluent node rewriting, a context-free graph grammar approach, to hypergraphs yields the most powerful known context-free technique to define hypergraph languages. This paper, which summarises part of the author's doctoral thesis, substantiates that claim by reporting on the generative power of the so-called C-hNCE grammars.
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.
