OVERLAP CLOSURES DO NOT SUFFICE FOR TERMINATION OF GENERAL TERM REWRITING-SYSTEMS

被引：2

作者：

ZHANG, XB

机构：

[1] Department of Computer Engineering and Science, Case Western Reserve University, Cleveland

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 37卷 / 01期

关键词：

TERM REWRITING SYSTEM (TRS); TERMINATION; OVERLAP CLOSURE;

D O I：

10.1016/0020-0190(91)90243-B

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present a nonterminating term rewriting system with only trivial overlap closures, thus settling two open problems concerning the use of the overlap closure construction as a criterion for termination.

引用

页码：9 / 11

页数：3

共 9 条

[1] TERMINATION OF REWRITING
DERSHOWITZ, N
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) : 69 - 116
[2] DERSHOWITZ N, 1987, J SYMB COMPUT, V4, P409
[3] DERSHOWITZ N, 1981, LECTURE NOTES COMPUT, V115, P448
[4] GEUPEL O, 1989, MIP8922 U PASS REP
[5] ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING-SYSTEMS
GUTTAG, JV
KAPUR, D
MUSSER, DR
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 189 - 214
[6] HUET G, 1980, FORMAL LANGUAGE THEO, P349
[7] LANKFORD DS, 1978, UNPUB FINITE TERMINA
[8] ON TERMINATION OF THE DIRECT SUM OF TERM-REWRITING SYSTEMS
RUSINOWITCH, M
[J]. INFORMATION PROCESSING LETTERS, 1987, 26 (02) : 65 - 70
[9] COUNTEREXAMPLES TO TERMINATION FOR THE DIRECT SUM OF TERM REWRITING-SYSTEMS
TOYAMA, Y
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (03) : 141 - 143

← 1 →