The termination hierarchy for term rewriting

被引：8
|
作者：
Zantema, H [1 ]
机构：
[1] Eindhoven Univ Technol, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING | 2001年 / 12卷 / 1-2期
关键词：
term rewriting; termination; string rewriting; monotone algebras;
D O I：
10.1007/s002000100061
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A number of properties of term rewriting systems related to termination are discussed, It is examined how these properties are affected by modifications in the definitions like weakening the requirement of strict monotonicity and adding embedding rules. All counterexamples to prove non-equivalence of properties are string rewriting systems, in most cases even single string rewrite rules.
引用
收藏
页码：3 / 19
页数：17
相关论文
共 50 条
12345