The Termination Hierarchy for Term Rewriting

被引：0
|
作者：
H. Zantema
机构：
[1] Department of Computing Science,
[2] Eindhoven University of Technology,undefined
[3] P.O. Box 513,undefined
[4] 5600 MB Eindhoven,undefined
[5] The Netherlands (e-mail: h.zantema@tue.nl),undefined
来源：
Applicable Algebra in Engineering, Communication and Computing | 2001年 / 12卷
关键词：
Keywords: Term rewriting, Termination, String rewriting, Monotone algebras.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：16
相关论文
共 50 条
12345