Equivalence of Mealy and Moore automata (Q2714401)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence of Mealy and Moore automata |
scientific article; zbMATH DE number 1604327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of Mealy and Moore automata |
scientific article; zbMATH DE number 1604327 |
Statements
13 June 2001
0 references
finite automaton with output
0 references
Moore automaton
0 references
Mealy automaton
0 references
Equivalence of Mealy and Moore automata (English)
0 references
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.
0 references
