No label defined (Q3336736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3870640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3870640 |
Statements
1984
0 references
substitution
0 references
term rewriting system
0 references
termination
0 references
0.8354945778846741
0 references
0.8132908344268799
0 references
0.8093286156654358
0 references
[For the entire collection see Zbl 0537.00025.] A term rewriting system R is terminating if there does not exist a derivation relation with infinite steps. In this paper the problem of E- termination of a set of rules R (where E is a set of equations) is considered. The problem is slightly different from the problem of termination because it allows equality steps between rewritings. It is shown that termination of the rewriting relation and E-termination are the same whenever the used rewriting relation is E-commuting. The E- termination of non E-commuting rewriting relations are studied: E- termination is reduced to the classical termination of the rewriting relation of an extended set of rules that has the E-commutation property.
0 references