In contrast , deterministic top - down tree automata are less powerful than their bottom - up counterparts .
In a deterministic tree automaton no two transition rules have the same left - hand side .
In contrast , deterministic top - down tree automata are less powerful than their bottom - up counterparts , because in a deterministic tree automaton no two transition rules have the same left - hand side .