Equivalence of Mealy and Moore automata
The paper considers Moore and Mealy automata as two versions of finite automata with output. It is proven that among all Moore automata equivalent to a given Mealy automaton, there is a (up to isomorphism) unique ''`simple''' (i.e., in a sense minimal) automaton that is a homomorphic image of all the others. A consequence of this result which is discussed in the paper concerns the decidability of certain equivalence problems. Similar results about unique Mealy automata are given.
scientific article; zbMATH DE number 1604327