A COMPLETION PROCEDURE FOR HIERARCHICAL CONDITIONAL REWRITING-SYSTEMS

被引：0

|

作者：

BOUSDIRA, W

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1988年 / 343卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：93 / 107

页数：15

相关论文

共 50 条

[41] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
WEIERMANN, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
[42] SEQUENTIALITY IN ORTHOGONAL TERM REWRITING-SYSTEMS
KLOP, JW
MIDDELDORP, A
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 12 (02) : 161 - 195
[43] SOLVING PERMUTATION PROBLEMS USING REWRITING-SYSTEMS
BROWN, C
COOPERMAN, G
FINKELSTEIN, L
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 358 : 364 - 377
[44] COMPLETE REWRITING-SYSTEMS AND HOMOLOGY OF MONOID ALGEBRAS
KOBAYASHI, Y
JOURNAL OF PURE AND APPLIED ALGEBRA, 1990, 65 (03) : 263 - 275
[45] REWRITING-SYSTEMS WITH LIMITED DISTANCE PERMITTING CONTEXT
VONSOLMS, SH
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1980, 8 (03) : 223 - 231
[46] SPECIFICATION OF REDUCTION STRATEGIES IN TERM REWRITING-SYSTEMS
VANEEKELEN, MCJD
PLASMEIJER, MJ
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 279 : 215 - 239
[47] A LOCAL TERMINATION PROPERTY FOR TERM REWRITING-SYSTEMS
LATCH, DM
SIGAL, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 222 - 233
[48] DATAFLOW ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS
BANACH, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 366 : 55 - 72
[49] DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS
KURIHARA, M
OHUCHI, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) : 314 - 320
[50] STATIC ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS
HANKIN, C
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 506 : 367 - 384

← 1 2 3 4 5 →