Definability Results for Top-Down Tree Transducers

被引：0
|
作者：
Maneth, Sebastian [1 ]
Seidl, Helmut [2 ]
Vu, Martin [1 ]
机构：
[1] Univ Bremen, FB3 Informat, Bremen, Germany
[2] Tech Univ Munich, Fak Informat, Munich, Germany
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2023年 / 34卷 / 02N03期
关键词：
Transducer; homomorphism; linearity;
D O I：
10.1142/S0129054122440051
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Top-down tree transducers are well established formalism for describing tree translations. Such transducers can be further enhanced with look-ahead allowing them to inspect input subtrees before processing them. Oftentimes it is advantageous to know when the look-ahead can be eliminated and the translation be implemented by a simpler transducer. We show that for a given top-down transducer with look-ahead it is decidable whether or not its translation is definable (1) by a linear deterministic top-down tree transducer or (2) by a tree homomorphism. We present algorithms that construct equivalent such transducers if they exist. Our results also apply to bottom-up transducers as well as compositions of transducers.
引用
收藏
页码：253 / 287
页数：35
相关论文
共 50 条
  • [31] On the equivalence problem for letter-to-letter top-down tree transducers
    Andre, Y
    Bossut, F
    THEORETICAL COMPUTER SCIENCE, 1998, 205 (1-2) : 207 - 229
  • [32] Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
    Miyahara, Kazuki
    Hashimoto, Kenji
    Seki, Hiroyuki
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (134): : 27 - 37
  • [33] Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
    Seidl, Helmut
    Maneth, Sebastian
    Kemper, Gregor
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 943 - 962
  • [34] VARIANTS OF TOP-DOWN TREE-TRANSDUCERS WITH LOOK-AHEAD
    FULOP, Z
    VAGVOLGYI, S
    MATHEMATICAL SYSTEMS THEORY, 1989, 21 (03): : 125 - 145
  • [35] Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition
    Lagoutte, Aurelie
    Maletti, Andreas
    ALGEBRAIC FOUNDATIONS IN COMPUTER SCIENCE: ESSAYS DEDICATED TO SYMEON BOZAPALIDIS ON THE OCCASION OF HIS RETIREMENT, 2011, 7020 : 272 - 308
  • [36] DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS WITH ITERATED LOOK-AHEAD
    SLUTZKI, G
    VAGVOLGYI, S
    THEORETICAL COMPUTER SCIENCE, 1995, 143 (02) : 285 - 308
  • [37] Look-ahead removal for total deterministic top-down tree transducers
    Engelfriet, Joost
    Maneth, Sebastian
    Seidl, Helmut
    THEORETICAL COMPUTER SCIENCE, 2016, 616 : 18 - 58
  • [38] The equivalence of bottom-up and top-down tree-to-graph transducers
    Engelfriet, J
    Vogler, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (03) : 332 - 356
  • [39] TOP-DOWN TREE-TRANSDUCERS WITH 2-WAY TREE WALKING LOOK-AHEAD
    VAGVOLGYI, S
    THEORETICAL COMPUTER SCIENCE, 1992, 93 (01) : 43 - 74
  • [40] On tbe top-down tree inclusion
    Chen, Yangjun
    Chen, Yibin
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND TECHNOLOGY, 2006, : 61 - +
12345