Jump to content

Term graph

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 174.53.163.119 (talk) at 14:20, 2 June 2013 ("A as well as B" should mean you'd expect B, but A is also true. Here it seems as if the opposiet was intended.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A term graph is a representation of an expression in a formal language as a generalized graph whose vertices are terms. Term graphs are a more powerful form of representation than expression trees because they can represent not only common subexpressions (i.e. they can take the structure of a directed acyclic graph) but also cyclic/recursive subexpressions (cyclic digraphs).

The phrase "term graph" is often used when discussing graph rewriting methods for transforming expressions in formal languages.

See also

Stub icon

This formal methods-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Term_graph&oldid=557977240"