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 条
  • [31] Bottom-Up Generative Modeling of Tree-Structured Data
    Bacciu, Davide
    Micheli, Alessio
    Sperduti, Alessandro
    NEURAL INFORMATION PROCESSING: THEORY AND ALGORITHMS, PT I, 2010, 6443 : 660 - +
  • [32] BOTTOM-UP AND TOP-DOWN TREE TRANSFORMATIONS - COMPARISON
    ENGELFRIET, J
    MATHEMATICAL SYSTEMS THEORY, 1975, 9 (03): : 198 - 231
  • [33] Neural network and tree automaton for seismic pattern recognition
    Huang, KY
    Chao, YH
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 663 - 668
  • [34] A cellular automaton that solves distributed spanning tree problem
    Roy, Souvik
    Ray, Arunima
    Das, Sukanta
    JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 26 : 39 - 54
  • [35] From Nondeterministic Suffix Automaton to Lazy Suffix Tree
    Fredriksson, Kimmo
    ALGORITHMS AND APPLICATIONS: ESSAYS DEDICATED TO ESKO UKKONEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2010, 6060 : 114 - 129
  • [36] A FAST ALGORITHM FOR CONSTRUCTING A TREE AUTOMATON RECOGNIZING A CONGRUENTIAL TREE LANGUAGE
    VAGVOLGYI, S
    THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 391 - 399
  • [37] Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
    Maletti, A
    THEORETICAL COMPUTER SCIENCE, 2005, 339 (2-3) : 200 - 240
  • [38] Bottom-up excitonics
    Aspuru-Guzik, Alan
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2016, 251
  • [39] A bottom-up review
    Standing, G
    FOREIGN POLICY, 2001, (122) : 8 - +
  • [40] Bottom-Up Management
    不详
    HUMAN ORGANIZATION, 1950, 9 (01) : 38 - 38
12345