Extended Multi Bottom-Up Tree Transducers

Extended multi bottom-up tree transducers are dened 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 bottomup tree transducers are generalized to extended multi bottom-up tree transducers. Finally, a characterization in terms of extended top-down tree transducers is presented.

• Type: Conference
• Year: 2008
• Where: DLT
• Authors: Joost Engelfriet, Eric Lilin, Andreas Maletti
• Keywords: Bottom-up Tree Transducers, DLT 2008, Multi Bottom-up Tree, Theoretical Computer Science, Tree Transducers