Mealy-automata in which the output-equivalence is a congruence

Every Mealy-automaton whose output equivalence is not the universal relation has a non-trivial simple state-homomorphic image. Thus the simple Mealy-automata play an importante role in the theory of Mealy-automata. It is very difficult to describe the structure of these automata. Contrary to the ear...

Full description

Saved in:
Bibliographic Details
Main Authors: Babcsányi István
Nagy Attila
Format: Article
Published: 1994
Series:Acta cybernetica 11 No. 3
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12524
Description
Summary:Every Mealy-automaton whose output equivalence is not the universal relation has a non-trivial simple state-homomorphic image. Thus the simple Mealy-automata play an importante role in the theory of Mealy-automata. It is very difficult to describe the structure of these automata. Contrary to the earlier investigations, in our present paper we concentrate our attention only to a special kind of simplicity, namely the strongly simplicity. Besides we give a construction for strongly simple Mealy-automata, we also describe the structure of all Mealy-automata which have strongly simple state-homomorphic image.
Physical Description:121-126
ISSN:0324-721X