REACHABILITY PROBLEM FOR QUASI-GROUND TERM REWRITING SYSTEMS.

被引：0

作者：

Oyamaguchi, Michio ^{[1
]}

机构：

[1] Mie Univ, Tsu, Jpn, Mie Univ, Tsu, Jpn

来源：

Journal of information processing | 1986年 / 9卷 / 04期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：232 / 236

共 50 条

[11] A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
Ciobaca, Stefan
Lucanu, Dorel
AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 295 - 311
[12] Reachability Problems on Regular Ground Tree Rewriting Graphs
Christof Löding
Theory of Computing Systems, 2006, 39 : 347 - 383
[13] GROUND TERM REWRITING
Vagvoelgyi, Sandor
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2010, (102): : 153 - 190
[14] DECIDABILITY OF CONFLUENCE FOR GROUND TERM REWRITING-SYSTEMS
DAUCHET, M
TISON, S
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 80 - 89
[15] COMPILATION OF GROUND TERM REWRITING-SYSTEMS AND APPLICATIONS
DAUCHET, M
DERUYVER, A
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 556 - 558
[16] Confluence of right ground term rewriting systems is decidable
Kaiser, L
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2005, 3441 : 470 - 489
[17] ON GROUND-CONFLUENCE OF TERM REWRITING-SYSTEMS
KAPUR, D
NARENDRAN, P
OTTO, F
INFORMATION AND COMPUTATION, 1990, 86 (01) : 14 - 31
[18] Innermost reachability and context sensitive reachability properties are decidable for linear right-shallow term rewriting systems
Kojima, Yoshiharu
Sakai, Masahiko
REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2008, 5117 : 187 - 201
[19] Rewriting Systems for Reachability in Vector Addition Systems with Pairs
de Naurois, Paulin Jacobe
Mogbil, Virgile
REACHABILITY PROBLEMS, 2010, 6227 : 133 - 145
[20] Reachability in unions of commutative rewriting systems is decidable
Bojanczyk, Mikolaj
Hoffman, Piotr
STACS 2007, PROCEEDINGS, 2007, 4393 : 622 - +

← 1 2 3 4 5 →