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 条

[41] The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Drewes, F
INFORMATION AND COMPUTATION, 2001, 169 (02) : 264 - 283
[42] Survey: Weighted Extended Top-down Tree Transducers Part I Basics and Expressive Power
Maletti, Andreas
ACTA CYBERNETICA, 2011, 20 (02): : 223 - 250
[43] Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation
Maletti, Andreas
FUNDAMENTA INFORMATICAE, 2011, 112 (2-3) : 239 - 261
[44] A hierarchy of deterministic top-down tree transformations
Slutzki, G
Vagvolgyi, S
MATHEMATICAL SYSTEMS THEORY, 1996, 29 (02): : 169 - 188
[45] Top-down Tree Transducers with Regular Look-ahead (vol 10, pg 289, 1977)
Engelfriet, Joost
THEORY OF COMPUTING SYSTEMS, 2016, 58 (02) : 377 - 379
[46] A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Fülöp, Z
Kühnemann, A
Vogler, H
INFORMATION PROCESSING LETTERS, 2004, 91 (02) : 57 - 67
[47] Top-down Causation Without Top-down Causes
Carl F. Craver
William Bechtel
Biology & Philosophy, 2007, 22 : 547 - 563
[48] Compositions with superlinear deterministic top-down tree transformations
Danyi, G
Fulop, Z
THEORETICAL COMPUTER SCIENCE, 1998, 194 (1-2) : 57 - 85
[49] Spectral top-down recovery of latent tree models
Aizenbud, Yariv
Jaffe, Ariel
Wang, Meng
Hu, Amber
Amsel, Noah
Nadler, Boaz
Chang, Joseph T.
Kluger, Yuval
INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2023, 12 (03)
[50] Text Summarization as Tree Transduction by Top-Down TreeLSTM
Bacciu, Davide
Bruno, Antonio
2018 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2018, : 1411 - 1418

← 1 2 3 4 5 →