Abstract
Extended multi bottom-up tree transducers are defined and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute any transformation that is computed by a linear extended top-down tree transducer. Moreover, the classical composition results for bottom-up tree transducers are generalized to extended multi bottom-up tree transducers. Finally, a characterization in terms of extended top-down tree transducers is presented. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Engelfriet, J., Lilin, E., & Maletti, A. (2008). Extended multi bottom-up tree transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 289–300). https://doi.org/10.1007/978-3-540-85780-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
