Speeding up subtree replacement systems (Q1142046): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4127402 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An abstract Church-Rosser theorem. II: Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree-Manipulating Systems and Church-Rosser Theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A class of replacement systems with simple optimality theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computation on graph-like expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal evaluations of graph-like expressions / rank | |||
Normal rank | |||
Latest revision as of 05:34, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up subtree replacement systems |
scientific article |
Statements
Speeding up subtree replacement systems (English)
0 references
1980
0 references
subtree replacement systems
0 references
speed-up
0 references
graph-like expressions
0 references
