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 条
  • [21] Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract)
    Bahr, Patrick
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (110): : 17 - 28
  • [22] Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics Extended Abstract
    Dougherty, Dan
    Lescanne, Pierre
    Liquori, Luigi
    Lang, Frederic
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 127 (05) : 57 - 82
  • [23] 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
  • [24] Undecidable properties of flat term rewrite systems
    Godoy, Guillem
    Hernandez, Hugo
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2009, 20 (02) : 187 - 205
  • [25] Real-counter automata and their decision problems (extended abstract)
    Dang, Zhe
    Ibarra, Oscar H.
    San Pietro, Pierluigi
    Xie, Gaoyan
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3328 : 198 - 210
  • [26] Classifying Words with 3-sort Automata: an extended abstract
    Jastrzab, Tomasz
    Lardeux, Frederic
    Monfroy, Eric
    39TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2024, 2024, : 787 - 788
  • [27] Hybrid acceleration using real vector automata (Extended abstract)
    Boigelot, B
    Herbreteau, R
    Jodogne, S
    COMPUTER AIDED VERIFICATION, 2003, 2725 : 193 - 205
  • [28] Reachability-time games on timed automata - (Extended abstract)
    Jurdzinski, Marcin
    Trivedi, Ashutosh
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 838 - +
  • [29] Recent developments in learning and competition with finite automata (Extended abstract)
    Neyman, Abraham
    Internet and Network Economics, Proceedings, 2006, 4286 : 1 - 2
  • [30] On the confluence of linear shallow term rewrite systems
    Godoy, G
    Tiwari, A
    Verma, R
    STACS 2003, PROCEEDINGS, 2003, 2607 : 85 - 96
12345