Distinguishability, Simulation and Universality of Moore Tree Automata
Eija Jurvanen, Marjo Lipponen · Fundamenta Informaticae · 1999
We extend the notions of distinguishability of states, simulation and universality of string automata to tree automata of Moore type. In particular, we prove that for each finite class of tree automata satisfying certain conditions, there is a unique