Equivalence of Mealy and Moore automata
type: Item
instance of: scholarly article
zbMATH Open document ID: 0973.68111
author: I. Babcsányi
publication date: 2001-06-13T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 1604327
zbMATH Keywords: finite automaton with output
zbMATH Keywords: Moore automaton
zbMATH Keywords: Mealy automaton
MaRDI profile type: Publication
title: Equivalence of Mealy and Moore automata
published in: Acta Cybernetica
review text: 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.
reviewed by: Heribert Vollmer
description: scientific article; zbMATH DE number 1604327