A PATH ORDERING FOR PROVING TERMINATION OF TERM REWRITING-SYSTEMS

被引：0

作者：

KAPUR, D ^{[1
]}

NARENDRAN, P ^{[1
]}

SIVAKUMAR, G ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 185卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：173 / 187

页数：15

共 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] ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING-SYSTEMS
GUTTAG, JV
KAPUR, D
MUSSER, DR
SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 189 - 214
[4] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
OHLEBUSCH, E
THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
[5] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
KURIHARA, M
KAJI, I
INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
[6] A LOCAL TERMINATION PROPERTY FOR TERM REWRITING-SYSTEMS
LATCH, DM
SIGAL, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 222 - 233
[7] DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS
KURIHARA, M
OHUCHI, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) : 314 - 320
[8] PROVING INDUCTIVE THEOREMS BASED ON TERM REWRITING-SYSTEMS
HOFBAUER, D
KUTSCHE, RD
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 343 : 180 - 190
[9] SOME PROPERTIES OF DECOMPOSITION ORDERING, A SIMPLIFICATION ORDERING TO PROVE TERMINATION OF REWRITING-SYSTEMS
LESCANNE, P
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1982, 16 (04): : 331 - 347
[10] DECIDABILITY OF CONFLUENCE AND TERMINATION OF MONADIC TERM REWRITING-SYSTEMS
SALOMAA, K
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 275 - 286

← 1 2 3 4 5 →