Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular look-ahead can be implemented by a linear multi bottom-up tree transducer. The class of transformations computed by the latter device is shown to be closed under composition, and to be included in the composition of the class of transformations computed by top-down tree transducers with itself. More precisely, it constitutes the composition closure of the class of transformations computed by finite-copying top-down tree transducers. © 2008 Elsevier Inc. All rights reserved.
Maletti, A. (2008). Compositions of extended top-down tree transducers. Information and Computation, 206(9–10), 1187–1196. https://doi.org/10.1016/j.ic.2008.03.019