The homomorphisms are linear and complete because the tree relation between a tree-substitution grammar derivation tree and its associated derived tree is exactly a linear complete tree homomorphism.
because they compute only the identity function, tree automata are of interest for their domains, not the mappings they compute.