 We can then formalize this by examining the formal language associated with each acceptance condition.We assume that the tree is ordered, and read the accept/reject strings off the leaves of the computation tree.For example, the nondeterministic machine will accept iff the leaf string is in the language {0, 1}*1{0, 1}*, and will reject iff the leaf string is in the language 0*.