A comparison of bottom-up pushdown tree transducers and top-down pushdown tree transducers

被引：0

作者：

Yamasaki, K ^{[1
]}

Sodeshima, Y ^{[1
]}

机构：

[1] Tokyo Univ Sci, Fac Sci & Technol, Dept Informat Sci, Noda, Chiba 2788510, Japan

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2002年 / E85D卷 / 05期

关键词：

pushdown automata; pushdown tree automata; nite state tree transducer (translation); pushdown tree transducer (translation);

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we introduce a bottom-up push-down tree transducer (b-PDTT) which is a bottom-up tree transducer with pushdown storage (where the pushdown storage stores the trees) and may be considered as a dual concept of the top-down pushdown tree transducer (t-PDTT), After proving some fundamental properties of b-PDTT, for example, any b-PDTT can be realized by a linear stack with single state and converted into G-type normal form which corresponds to Greibach normal form in a context-free grammar. and so on, we compare the translational capability of a b-PDTT with that of a t-PDTT.

引用

页码：799 / 811

页数：13

共 50 条

[1] Some notes on domain tree languages of top-down pushdown tree transducers
Yamasaki, K
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2000, E83D (09): : 1713 - 1720
[2] The equivalence of bottom-up and top-down tree-to-graph transducers
Engelfriet, J
Vogler, H
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 56 (03) : 332 - 356
[3] Alphabetic pushdown tree transducers
Rahonis, G
[J]. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2003, 2710 : 423 - 436
[4] The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Drewes, F
[J]. INFORMATION AND COMPUTATION, 2001, 169 (02) : 264 - 283
[5] BOTTOM-UP AND TOP-DOWN TREE TRANSFORMATIONS - COMPARISON
ENGELFRIET, J
[J]. MATHEMATICAL SYSTEMS THEORY, 1975, 9 (03): : 198 - 231
[6] A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Fülöp, Z
Kühnemann, A
Vogler, H
[J]. INFORMATION PROCESSING LETTERS, 2004, 91 (02) : 57 - 67
[7] HIGH-LEVEL TREE-TRANSDUCERS AND ITERATED PUSHDOWN TREE-TRANSDUCERS
ENGELFRIET, J
VOGLER, H
[J]. ACTA INFORMATICA, 1988, 26 (1-2) : 131 - 192
[8] COMPOSITION OF TOP-DOWN AND BOTTOM-UP TREE TRANSDUCTIONS
BAKER, BS
[J]. INFORMATION AND CONTROL, 1979, 41 (02): : 186 - 213
[9] Compositions of Top-Down Tree Transducers with ε-Rules
Maletti, Andreas
Vogler, Heiko
[J]. FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2010, 6062 : 69 - +
[10] BOTTOM-UP TREE PUSHDOWN-AUTOMATA AND REWRITE SYSTEMS
COQUIDE, JL
DAUCHET, M
GILLERON, R
VAGVOLGYI, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 287 - 298

← 1 2 3 4 5 →