Speeding up subtree replacement systems
type: Item
instance of: scholarly article
title: Speeding up subtree replacement systems
zbMATH Open document ID: 0438.68032
DOI: 10.1016/0304-3975(80)90033-X
author: John Staples
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3684914
zbMATH Keywords: subtree replacement systems
zbMATH Keywords: speed-up
zbMATH Keywords: graph-like expressions
MaRDI profile type: Publication
cites work: Q4127402
cites work: An abstract Church-Rosser theorem. II: Applications
cites work: Tree-Manipulating Systems and Church-Rosser Theorems
cites work: A class of replacement systems with simple optimality theory
cites work: Computation on graph-like expressions
cites work: Optimal evaluations of graph-like expressions
full work available at URL: 0304-3975(80)90033-x
OpenAlex ID: W2030550007
description: scientific article; zbMATH DE number 3684914