Recognizing Relations by Tree Automata
Sándor Vágvölgyi · Universitätsbibliothek Gießen · 2013
We introduce the relation $\xi(A)$ recognized by a tree automaton $A$. For any tree automaton $A$, it is decidable whether there is a deterministic tree automaton $B$ such that $\xi(A) = \xi(B)$. If the answer is yes, then we can construct such $B$.