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
相关论文
共 50 条
  • [11] Extended process rewrite systems:: Expressiveness and reachability
    Kretínsky, M
    Rehák, V
    Strejcek, J
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 355 - 370
  • [12] TERM REWRITE SYSTEMS FOR LATTICE THEORY
    FREESE, R
    JEZEK, J
    NATION, JB
    JOURNAL OF SYMBOLIC COMPUTATION, 1993, 16 (03) : 279 - 288
  • [13] Symbol different term rewrite systems
    Vagvoelgyi, Sandor
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2015, 84 (05) : 551 - 575
  • [14] Various Aspects of Finite Quantum Automata (Extended Abstract)
    Hirvensalo, Mika
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 21 - 33
  • [15] Concavely-Priced Timed Automata (Extended Abstract)
    Jurdzinski, Marcin
    Trivedi, Ashutosh
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 48 - 62
  • [16] On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
    Klima, Ondrej
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (151): : 49 - 54
  • [17] Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems
    Guillem Godoy
    Ashish Tiwari
    Rakesh Verma
    Applicable Algebra in Engineering, Communication and Computing, 2004, 15 : 13 - 36
  • [18] Characterizing confluence by rewrite closure and right ground term rewrite systems
    Godoy, G
    Tiwari, A
    Verma, R
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2004, 15 (01) : 13 - 36
  • [19] Tree automata for rewrite strategies
    Réty, P
    Vuotto, J
    JOURNAL OF SYMBOLIC COMPUTATION, 2005, 40 (01) : 749 - 794
  • [20] Reachability is decidable for weakly extended process rewrite systems
    Kretinsky, Mojmir
    Rehak, Vojtech
    Strejcek, Jan
    INFORMATION AND COMPUTATION, 2009, 207 (06) : 671 - 680
12345