Speeding up subtree replacement systems

DOI10.1016/0304-3975(80)90033-XMaRDI QIDQ1142046zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3553769 (Why is no real title available?)
• A class of replacement systems with simple optimality theory
• An abstract Church-Rosser theorem. II: Applications
• Computation on graph-like expressions
• Optimal evaluations of graph-like expressions
• Tree-Manipulating Systems and Church-Rosser Theorems

Cited in

(6)

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

This page was built for publication: Speeding up subtree replacement systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142046)