Babcsányi István and Nagy Attila: Mealy-automata in which the output-equivalence is a congruence. In: Acta cybernetica, (11) 3. pp. 121-126. (1994)
Preview |
Cikk, tanulmány, mű
cybernetica_011_numb_003_121-126.pdf Download (563kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1994 |
| Volume: | 11 |
| Number: | 3 |
| ISSN: | 0324-721X |
| Page Range: | pp. 121-126 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38497/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: 126. p. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 11:22 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12524 |
Actions (login required)
 |
View Item |
