2002 | OriginalPaper | Buchkapitel
Graph Rewriting
verfasst von : Enno Ohlebusch
Erschienen in: Advanced Topics in Term Rewriting
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
For reasons of efficiency, term rewriting is usually implemented by graph rewriting. In term rewriting, expressions are represented as terms, whereas in graph rewriting1 these are represented as directed graphs. In contrast to the former, the latter representation allows a sharing of common subexpressions. In graph rewriting expressions are evaluated by rule-based graph transformations. Here we will only consider directed acyclic graphs.