Hostname: page-component-cb9f654ff-9b74x Total loading time: 0 Render date: 2025-08-18T11:00:29.182Z Has data issue: false hasContentIssue false
  • English
  • Français

Normal forms for context-free node-rewriting hypergraph grammars

Published online by Cambridge University Press:  08 May 2002

RENATE KLEMPIEN-HINRICHS
RENATE KLEMPIEN-HINRICHS
Affiliation:
Universität Bremen, Fachbereich Mathematik/Informatik, Postfach 33 04 40, 28334 Bremen, Germany; Email: rena@informatik.uni-bremen.de
Get access Rights & Permissions [Opens in a new window]

Abstract

Confluent node-rewriting hypergraph grammars represent the most comprehensive known method for defining sets of hypergraphs in a recursive way. For a large natural subclass of these grammars, we show that the maximal rank of hyperedges indispensable for generating some set of hypergraphs equals the maximal rank of the hyperedges occurring in the hypergraphs of that set. Moreover, if such a grammar generates a set of graphs, one can construct from that grammar a C-edNCE graph grammar generating the same set of graphs.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 12 , Issue 2 , April 2002 , pp. 135 - 148
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable