ON CONFLUENCE OF ONE-RULE TRACE-REWRITING SYSTEMS

被引：5

作者：

WRATHALL, C ^{[1
]}

DIEKERT, V ^{[1
]}

机构：

[1] UNIV STUTTGART,INST INFORMAT,W-7000 STUTTGART 80,GERMANY

来源：

MATHEMATICAL SYSTEMS THEORY | 1995年 / 28卷 / 04期

关键词：

D O I：

10.1007/BF01185401

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The paper presents combinatorial criteria for confluence of one-rule trace-rewriting systems. The criteria are based on self-overlaps of traces, which are closely related to the notion of conjugacy of traces, and can be tested in linear time. As a special case, we reobtain the corresponding results for strings.

引用

页码：341 / 361

页数：21

共 50 条

[31] Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
Rao, MRKK
[J]. ACTA INFORMATICA, 1996, 33 (06) : 595 - 606
[32] A NOTE ON A SPECIAL ONE-RULE SEMI-THUE SYSTEM
JANTZEN, M
[J]. INFORMATION PROCESSING LETTERS, 1985, 21 (03) : 135 - 140
[33] Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering
Aoto, Takahito
[J]. FRONTIERS OF COMBINING SYSTEMS (FROCOS 2013), 2013, 8152 : 311 - 326
[34] Confluence of right ground term rewriting systems is decidable
Kaiser, L
[J]. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 470 - 489
[35] Local confluence of conditional and generalized term rewriting systems
Lucas, Salvador
[J]. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2024, 136
[36] DECIDABILITY OF CONFLUENCE FOR GROUND TERM REWRITING-SYSTEMS
DAUCHET, M
TISON, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 80 - 89
[37] Reachability and confluence are undecidable for flat term rewriting systems
Jacquemard, F
[J]. INFORMATION PROCESSING LETTERS, 2003, 87 (05) : 265 - 270
[38] Confluence proofs of term rewriting systems based on persistency
[J]. 1600, Japan Society for Software Science and Technology (30):
[39] Conditions for confluence of innermost terminating term rewriting systems
Sayaka Ishizuki
Michio Oyamaguchi
Masahiko Sakai
[J]. Applicable Algebra in Engineering, Communication and Computing, 2019, 30 : 349 - 360
[40] Infinite Families of Finite String Rewriting Systems and Their Confluence
Jouannaud, Jean-Pierre
Monate, Benjamin
[J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 387 - +

← 1 2 3 4 5 →