  We show that it is decidable whether a given a regular tree language belongs
to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether
the Wadge degree of a regular tree language is countable.
