Speeding up subtree replacement systems

DOI10.1016/0304-3975(80)90033-XzbMath0438.68032OpenAlexW2030550007MaRDI QIDQ1142046

John Staples

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90033-x

zbMATH Keywords

speed-upsubtree replacement systemsgraph-like expressions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Term graph rewriting and garbage collection using opfibrations, On ``On graph rewritings, Computation on graph-like expressions, Optimal evaluations of graph-like expressions, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Transformations of structures: An algebraic approach

Cites Work

• Computation on graph-like expressions
• Optimal evaluations of graph-like expressions
• An abstract Church-Rosser theorem. II: Applications
• A class of replacement systems with simple optimality theory
• Tree-Manipulating Systems and Church-Rosser Theorems
• Unnamed Item