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 条

[21] Term Orderings for Non-reachability of (Conditional) Rewriting
Yamada, Akihisa
AUTOMATED REASONING, IJCAR 2022, 2022, 13385 : 248 - 267
[22] Reachability analysis of mobile ambients in fragments of AC term rewriting
Delzanno, Giorgio
Montagna, Roberto
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2006, 2006, 4281 : 302 - 316
[23] Reachability analysis of fragments of mobile ambients in AC term rewriting
Delzanno, Giorgio
Montagna, Roberto
FORMAL ASPECTS OF COMPUTING, 2008, 20 (4-5) : 407 - 428
[24] Term rewriting restricted to ground terms
Vágvölgyi, S
THEORETICAL COMPUTER SCIENCE, 2003, 302 (1-3) : 135 - 165
[25] THE REACHABILITY PROBLEM FOR GROUND TRS AND SOME EXTENSIONS
DERUYVER, A
GILLERON, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 351 : 227 - 243
[26] Reachability Analysis of Multithreaded Programs Using Communicating Rewriting Systems
Nasraoui, Brahim
Robbana, Riadh
PROCEEDINGS 2016 IEEE 40TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSAC), VOL 2, 2016, : 228 - 233
[27] Natural rewriting for general term rewriting systems
Escobar, S
Meseguer, J
Thati, P
LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2005, 3573 : 101 - 116
[28] On Ground Word Problem of Term Equation Systems
Vagvolgyi, Sandor
ACTA CYBERNETICA, 2015, 22 (02): : 517 - 551
[29] THE CHURCH-ROSSER PROPERTY FOR GROUND TERM-REWRITING SYSTEMS IS DECIDABLE
OYAMAGUCHI, M
THEORETICAL COMPUTER SCIENCE, 1987, 49 (01) : 43 - 79
[30] TESTING FOR THE GROUND (CO-)REDUCIBILITY PROPERTY IN TERM-REWRITING SYSTEMS
KOUNALIS, E
THEORETICAL COMPUTER SCIENCE, 1992, 106 (01) : 87 - 117

← 1 2 3 4 5 →