Found 1 document(s)
Page 1 of 1
-
We study finite automata running over infinite binary trees. A run of such an automaton over an input tree is a tree labeled by control states of the automaton: the labelling is built in a top-down fashion and should be ...