Universality on Tree Automata of MooreType
Eija Jurvanen, Marjo Lipponen · 1998
We define a new type of tree automaton with output as a generalization of Moore automata. The new structure allows us to study how Moore's gedanken-experiments, where the experimenter knows only the inputs and outputs of the automaton, are applicable to trees. In particular, we study simulation, minimality and universality of such automata. TUCS Research Group