Expressing descendants or the rewrite relation by tree-(tuple)
languages allows to deal with R-matching and R-unification
problems. We present in addition a new class of tree-tuple
languages, more expressive than former ones, but having the same
properties. Thanks to this new class, we hope to solve more
interesting R-matching and R-unification problems.