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 条
  • [21] Composition Closure of Linear Extended Top-down Tree Transducers
    Engelfriet, Joost
    Fulop, Zoltan
    Maletti, Andreas
    THEORY OF COMPUTING SYSTEMS, 2017, 60 (02) : 129 - 171
  • [22] THE TRANSLATION POWER OF TOP-DOWN TREE-TO-GRAPH TRANSDUCERS
    ENGELFRIET, J
    VOGLER, H
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (02) : 258 - 305
  • [23] Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
    Loding, Christof
    Winter, Sarah
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (161): : 88 - 101
  • [24] Synthesis of deterministic top-down tree transducers from automatic tree relations
    Loeding, Christof
    Winter, Sarah
    INFORMATION AND COMPUTATION, 2017, 253 : 336 - 354
  • [25] Some notes on domain tree languages of top-down pushdown tree transducers
    Yamasaki, K
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (09): : 1713 - 1720
  • [26] Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
    Fulop, Zoltan
    Maletti, Andreas
    IMPLEMENTATION AND APPLICATION OF AUTOMATA (CIAA 2019), 2019, 11601 : 133 - 145
  • [27] Erratum to: “Top-down Tree Transducers with Regular Look-ahead”
    Joost Engelfriet
    Theory of Computing Systems, 2016, 58 : 377 - 379
  • [28] Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
    Miyahara, Kazuki
    Hashimoto, Kenji
    Seki, Hiroyuki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (03): : 512 - 523
  • [29] Syntactic composition of top-down tree transducers is short cut fusion
    Jürgensen, C
    Vogler, H
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2004, 14 (02) : 215 - 282
  • [30] Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
    Seidl, Helmut
    Maneth, Sebastian
    Kemper, Gregor
    JOURNAL OF THE ACM, 2018, 65 (04)
12345