Tree automata for rewrite strategies

被引：9

作者：

Réty, P ^{[1
]}

Vuotto, J ^{[1
]}

机构：

[1] Univ Orleans, LIFO, F-45067 Orleans, France

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 2005年 / 40卷 / 01期

关键词：

term rewriting; strategy; tree automaton;

D O I：

10.1016/j.jsc.2004.12.008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

For a constructor-based rewrite system R, a regular set of ground terms E, and assuming some additional restrictions, we build finite tree automata that recognize the descendants of E, i.e. the terms issued from E by rewriting, according to innermost, outermost, leftmost, and innermost-leftmost strategies. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：749 / 794

页数：46

共 50 条

[1] Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Durand, Irene
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 124 (02) : 29 - 49
[2] BOTTOM-UP TREE PUSHDOWN-AUTOMATA AND REWRITE SYSTEMS
COQUIDE, JL
DAUCHET, M
GILLERON, R
VAGVOLGYI, S
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 287 - 298
[3] BOTTOM-UP TREE PUSHDOWN-AUTOMATA - CLASSIFICATION AND CONNECTION WITH REWRITE SYSTEMS
COQUIDE, JL
DAUCHET, M
GILLERON, R
VAGVOLGYI, S
THEORETICAL COMPUTER SCIENCE, 1994, 127 (01) : 69 - 98
[4] COMPLETENESS OF REWRITE RULES AND REWRITE STRATEGIES FOR FP
HALPERN, JY
WILLIAMS, JH
WIMMERS, EL
JOURNAL OF THE ACM, 1990, 37 (01) : 86 - 143
[5] DESIGN STRATEGIES FOR REWRITE RULES
ANTOY, S
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 333 - 341
[6] Regular tree languages and rewrite systems
Fundam Inf, 1-2 (157):
[7] Senescent Ground Tree Rewrite Systems
Hague, M.
PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
[8] Nee automata and term rewrite systems (Extended abstract)
Tison, S
REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS, 2000, 1833 : 27 - 30
[9] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
Goeller, Stefan
Lin, Anthony Widjaja
CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 543 - +
[10] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
Goeller, Stefan
Lin, Anthony Widjaja
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2014, 15 (04)

← 1 2 3 4 5 →