Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ohlebusch, E. (2002). Graph Rewriting. In: Advanced Topics in Term Rewriting. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3661-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3661-8_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2921-1
Online ISBN: 978-1-4757-3661-8
eBook Packages: Springer Book Archive