Structural equivalence of automata

This paper concerns with the problem of comparing structures of automata which are in general incomplete and non-deterministic. It is shown here that in many cases where behavioral equivalence between automata have been established in the literature, those automata are also structurally equivalent. A necessary and sufficient condition is also given for a class of automata to be structurally equivalent.