Equivalence of Mealy and Moore automata

Babcsányi István: Equivalence of Mealy and Moore automata. In: Acta cybernetica, (14) 4. pp. 541-552. (2000)

[thumbnail of cybernetica_014_numb_004_541-552.pdf]
Cikk, tanulmány, mű

Download (705kB) | Preview


It is proved here that every Mealy automaton is a liomomorphic image of a Moore automaton, and among these Moore automata (up to isomorphism) there exists a unique one which is a homomorphic image of the others. A unique simple Moore automaton M is constructed (up to isomorphism) in the set MO(A) of all Moore automata equivalent to a Mealy automaton A such that M is a homomorphic image of every Moore automaton belonging to MO{A). By the help of this construction, it can be decided in steps |X|k that automaton mappings inducing by states of a k-uniform finite Mealy [Moore] automaton are equal or not. The structures of simple k-uniform Mealy [Moore] automata are described by the results of [1]. It gives a possibility for us to get the k-uniform Mealy [Moore] automata from the simple k-uniform Mealy [Moore] automata. Based on these results, we give a construction for finite Mealy [Moore] automata.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2000
Volume: 14
Number: 4
ISSN: 0324-721X
Page Range: pp. 541-552
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38510/
Uncontrolled Keywords: Számítástechnika, Kibernetika, Automaták
Additional Information: Bibliogr.: p. 551-552. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 14. 10:20
URI: http://acta.bibl.u-szeged.hu/id/eprint/12648

Actions (login required)

View Item View Item