Regular tree languages in low levels of the Wadge Hierarchy

In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the class of the Boolean combinations of open sets $BC({\mathrm{\Sigma }}_1^0)$ (i.e. the union of the first $\omega$ levels); and for the Borel class ${\mathrm{\Delta }}_2^0$ (i.e. for the union of the first ${\omega }_1$ levels).