ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING-SYSTEMS

被引：27

作者：

GUTTAG, JV ^{[1
]}

KAPUR, D ^{[1
]}

MUSSER, DR ^{[1
]}

机构：

[1] GE,CORP RES & DEV,SCHENECTADY,NY 12301

来源：

SIAM JOURNAL ON COMPUTING | 1983年 / 12卷 / 01期

关键词：

D O I：

10.1137/0212012

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：189 / 214

页数：26

共 50 条

[1] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
WEIERMANN, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
[2] PROVING TERMINATION OF ASSOCIATIVE COMMUTATIVE REWRITING-SYSTEMS BY REWRITING
GNAEDIG, I
LESCANNE, P
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 52 - 61
[3] A PATH ORDERING FOR PROVING TERMINATION OF TERM REWRITING-SYSTEMS
KAPUR, D
NARENDRAN, P
SIVAKUMAR, G
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 185 : 173 - 187
[4] Proving termination of ω rewriting systems
Shigeta, Y
Akama, K
Koike, H
Ishikawa, T
INTERNATIONAL CONFERENCE ON COMPUTING AND INFORMATION TECHNOLOGIES : EXPLORING EMERGING TECHNOLOGIES, 2001, : 399 - 404
[5] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
OHLEBUSCH, E
THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
[6] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
KURIHARA, M
KAJI, I
INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
[7] RELATING INNERMOST, WEAK, UNIFORM AND MODULAR TERMINATION OF TERM REWRITING-SYSTEMS
GRAMLICH, B
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 285 - 296
[8] A LOCAL TERMINATION PROPERTY FOR TERM REWRITING-SYSTEMS
LATCH, DM
SIGAL, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 222 - 233
[9] DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS
KURIHARA, M
OHUCHI, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) : 314 - 320
[10] TERMINATION OF REWRITING-SYSTEMS BY POLYNOMIAL INTERPRETATIONS AND ITS IMPLEMENTATION
BENCHERIFA, A
LESCANNE, P
SCIENCE OF COMPUTER PROGRAMMING, 1987, 9 (02) : 137 - 159

← 1 2 3 4 5 →