Hypergraph grammar

In computer science, a hypergraph grammar (also a hyperedge replacement system) is a class of graph grammar with hyperedges rather than simple edges. Hypergraphs prove to be a particularly fruitful class of graph to treat for applications of replacement systems; in particular they model typical data structures very naturally.

Implementations and applications

Notes

  1. Minas (1997)

References

This article is issued from Wikipedia - version of the 9/26/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.