The Bottom-Up Position Tree Automaton and the Father Automaton

被引：1
|
作者：
Attou, Samira [1 ,2 ]
Mignot, Ludovic [1 ,2 ]
Ziadi, Djelloul [1 ,2 ]
机构：
[1] USTHB, Fac Math, RECITS Lab, BP 32, Algiers 16111, Algeria
[2] Univ Rouen Normandie, Grp Rech Rouennais Informat Fondamentale, Ave Univ, F-76801 St Etienne Du Rouvray, France
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2020年 / 31卷 / 08期
关键词：
Regular tree expressions; position automaton; top-down; bottom-up; REGULAR EXPRESSIONS;
D O I：
10.1142/S0129054120420034
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a top-down interpretation of tree automata. In this paper, we propose new constructions based on Gluskov's one and on the one by Ilie and Yu using a bottom-up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, something which cannot be done with classical top-down approaches.
引用
收藏
页码：1051 / 1068
页数：18
相关论文
共 50 条
  • [1] The Bottom-Up Position Tree Automaton and Its Compact Version
    Attou, Samira
    Mignot, Ludovic
    Ziadi, Djelloul
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2018, 2018, 10977 : 59 - 70
  • [2] Tree automaton with tree memory
    Nakanishi, R
    Hayakawa, I
    Seki, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1998, E81D (02) : 161 - 170
  • [3] BOTTOM-UP TREE ACCEPTORS
    HEMERIK, C
    KATOEN, JP
    SCIENCE OF COMPUTER PROGRAMMING, 1989, 13 (01) : 51 - 72
  • [4] Bottom-up tree acceptors
    Hemerik, C., 1600, (13):
  • [5] Bottom-Up derivatives of tree expressions
    Attou, Samira
    Mignot, Ludovic
    Ziadi, Djelloul
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2021, 55
  • [6] ALTERNATING BOTTOM-UP TREE RECOGNIZERS
    SALOMAA, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 214 : 158 - 171
  • [7] TREE COMPRESSION PUSHDOWN AUTOMATON
    Poliak, Martin
    Janousek, Jan
    Melichar, Borivoj
    KYBERNETIKA, 2012, 48 (03) : 429 - 452
  • [8] Bottom-Up Tree Automata with Term Constraints
    Reuss, Andreas
    Seidl, Helmut
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 581 - 593
  • [9] Extended Multi Bottom-Up Tree Transducers
    Engelfriet, Joost
    Lilin, Eric
    Maletti, Andreas
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 289 - +
  • [10] Extended multi bottom-up tree transducers
    Engelfriet, Joost
    Lilin, Eric
    Maletti, Andreas
    ACTA INFORMATICA, 2009, 46 (08) : 561 - 590
12345