Compositions of Bottom-Up Tree Series Transformations

Andreas Maletti · 2005

Tree series transformations computed by bottom-up tree series transducers are called bottom-up tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottom-up tree series transformations over commutative and ...-complete semirings are closed under left-composition with linear bottom-up tree series transformations and right-composition with boolean deterministic bottom-up tree series transformations.

Read the paper · More papers on PaperTik