  We introduce a class of algebras that can be used as recognisers for regular
tree languages. We show that it is the only such class that forms a
pseudo-variety and we prove the existence of syntactic algebras. Finally, we
give a more algebraic characterisation of the algebras in our class.
