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 条
  • [31] Rewriting and tree automata
    Dauchet, M
    TERM REWRITING, 1995, 909 : 95 - 113
  • [32] SYNCHRONIZED TREE AUTOMATA
    SALOMAA, K
    THEORETICAL COMPUTER SCIENCE, 1994, 127 (01) : 25 - 51
  • [33] PROBABILISTIC TREE AUTOMATA
    ELLIS, CA
    INFORMATION AND CONTROL, 1971, 19 (05): : 401 - &
  • [34] Regulated Tree Automata
    Fernau, Henning
    Vu, Martin
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2019, 2019, 11612 : 124 - 136
  • [35] From Tree Automata to String Automata Minimization
    Guellouma, Younes
    Cherroun, Hadda
    Ziadi, Djelloul
    Watson, Bruce W.
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (05) : 1203 - 1222
  • [36] ITERATIVE TREE AUTOMATA
    CULIK, K
    YU, S
    THEORETICAL COMPUTER SCIENCE, 1984, 32 (03) : 227 - 247
  • [37] MINIMALIZATION OF TREE AUTOMATA
    BRAINERD, WS
    INFORMATION AND CONTROL, 1968, 13 (05): : 484 - &
  • [38] PUSHDOWN TREE AUTOMATA
    GUESSARIAN, I
    MATHEMATICAL SYSTEMS THEORY, 1983, 16 (04): : 237 - 263
  • [39] Nondeterministic tree automata
    Niessner, F
    AUTOMATA, LOGICS, AND INFINITE GAMES: A GUIDE TO CURRENT RESEARCH, 2002, 2500 : 135 - 152
  • [40] Tree Automata Mining
    Przybylek, Michal R.
    COMPUTATIONAL INTELLIGENCE, IJCCI 2013, 2016, 613 : 137 - 154
12345