A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers
Summary :
In this paper we introduce a bottom-up pushdown 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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E85-D No.5 pp.799-811
- Publication Date
- 2002/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Theory of Automata, Formal Language Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Katsunori YAMASAKI, Yoshichika SODESHIMA, "A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 5, pp. 799-811, May 2002, doi: .
Abstract: In this paper we introduce a bottom-up pushdown 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_5_799/_p
Copy
@ARTICLE{e85-d_5_799,
author={Katsunori YAMASAKI, Yoshichika SODESHIMA, },
journal={IEICE TRANSACTIONS on Information},
title={A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers},
year={2002},
volume={E85-D},
number={5},
pages={799-811},
abstract={In this paper we introduce a bottom-up pushdown 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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Comparison of Bottom-Up Pushdown Tree Transducers and Top-Down Pushdown Tree Transducers
T2 - IEICE TRANSACTIONS on Information
SP - 799
EP - 811
AU - Katsunori YAMASAKI
AU - Yoshichika SODESHIMA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2002
AB - In this paper we introduce a bottom-up pushdown 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.
ER -
English
