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：

暂无

中图分类号：

学科分类号：

摘要：

8

引用

收藏

页码：232 / 236

相关论文

共 50 条

[1] NOTE ON QUASI-GROUND BAND
HASEGAWA, A
TANAKA, H
PROGRESS OF THEORETICAL PHYSICS, 1973, 49 (03): : 1046 - 1047
[2] Reachability Analysis over Term Rewriting Systems
Guillaume Feuillade
Thomas Genet
Valérie Viet Triem Tong
Journal of Automated Reasoning, 2004, 33 : 341 - 383
[3] Reachability analysis over term rewriting systems
Feuillade, G
Genet, T
Tong, VVT
JOURNAL OF AUTOMATED REASONING, 2004, 33 (3-4) : 341 - 383
[4] Reachability and confluence are undecidable for flat term rewriting systems
Jacquemard, F
INFORMATION PROCESSING LETTERS, 2003, 87 (05) : 265 - 270
[5] The unification problem for confluent right-ground term rewriting systems
Oyamaguchi, M
Ohta, Y
INFORMATION AND COMPUTATION, 2003, 183 (02) : 187 - 211
[6] DECIDABILITY OF REACHABILITY AND DISJOINT UNION OF TERM REWRITING-SYSTEMS
CARON, AC
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 581 : 86 - 101
[7] DECIDABILITY OF REACHABILITY FOR DISJOINT UNION OF TERM REWRITING-SYSTEMS
CARON, AC
COQUIDE, JL
THEORETICAL COMPUTER SCIENCE, 1994, 126 (01) : 31 - 52
[8] PROOFS AND REACHABILITY PROBLEM FOR GROUND REWRITE SYSTEMS
COQUIDE, JL
GILLERON, R
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 464 : 120 - 129
[9] Derivation trees of ground term rewriting systems
Engelfriet, J
INFORMATION AND COMPUTATION, 1999, 152 (01) : 1 - 15
[10] Reachability problems on regular ground tree rewriting graphs
Löding, C
THEORY OF COMPUTING SYSTEMS, 2006, 39 (02) : 347 - 383

← 1 2 3 4 5 →