  Subzero automata is a class of tree automata whose acceptance condition can
express probabilistic constraints. Our main result is that the problem of
determining if a subzero automaton accepts some regular tree is decidable.
