Word-into-Tree Transducers with Bounded Difference

Non-deleting Word-into-Trees Transducers with bounded difference are investigated in this paper. Informally, these transducers which produce trees from words have the property that the difference of height of any couple of trees (the input tree being a word) is bounded. We establish the fact that the tree transformations induced by such transducers have some good closure properties.