Nee automata and term rewrite systems (Extended abstract)

被引：0
作者：
Tison, S [1 ]
机构：
[1] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France
来源：
REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS | 2000年 / 1833卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This tutorial is devoted to tree automata. We will present some of the most fruitful applications of tree automata in rewriting theory and we will give an outline of the current state of research on tree automata. We give here just a sketch of the presentation. The reader can also refer to the on-line book "Tree Automata and Their Applications" [CDG(+)97].
引用
收藏
页码：27 / 30
页数：4
相关论文
共 27 条
  • [1] TREE GENERATING REGULAR SYSTEMS
    BRAINERD, WS
    [J]. INFORMATION AND CONTROL, 1969, 14 (02): : 217 - &
  • [2] BRAINERD WS, 1969, P 10 IEEE S FDN COMP, P240
  • [3] CARON AC, 1999, LNCS, V1631
  • [4] Ground reducibility is EXPTIME-complete
    Comon, H
    Jacquemard, F
    [J]. 12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 26 - 34
  • [5] COMON H, 1994, LNCS, V775, P151
  • [6] COMON H, 1995, P 10 ANN IEEE S LOG
  • [7] BOTTOM-UP TREE PUSHDOWN-AUTOMATA - CLASSIFICATION AND CONNECTION WITH REWRITE SYSTEMS
    COQUIDE, JL
    DAUCHET, M
    GILLERON, R
    VAGVOLGYI, S
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 127 (01) : 69 - 98
  • [8] Dauchet M., 1990, Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science (90CH2897-7), P242, DOI 10.1109/LICS.1990.113750
  • [9] Automata for reduction properties solving
    Dauchet, M
    Caron, AC
    Coquide, JL
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1995, 20 (02) : 215 - 233
  • [10] DAUCHET M, 1994, LNCS
123