Jump to content

Attributed graph grammar

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cabayi (talk | contribs) at 11:18, 24 September 2016 (Added {{unreferenced}} tag to article (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, an attribute graph grammar is a class of graph grammar that associates vertices with a set of attributes and rewrites with functions on attributes. In the algebraic approach to graph grammars, they are usually formulated using the double-pushout approach or the single-pushout approach.