Recognizable Tree-Languages And Non-Linear Morphisms

We try to understand certain complex phenomena which appear in the study of tree morphisms in the non-linear case. We prove that every transformation performed by a quasi-alphabetic homorphism that maps a recognizable tree language to another one can be done "without using non-linearity". As a corollary, we get an extension of the cross-section theorem.