Groups and semigroups defined by some classes of mealy automata

Antonenko Aleksander S. and Berkovič Eugene L.: Groups and semigroups defined by some classes of mealy automata. In: Acta cybernetica, (18) 1. pp. 23-46. (2007)

[thumbnail of Antonenko_2007_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (237kB) | Preview


Two classes of finite Mealy automata (automata without branches, slowmoving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2007
Volume: 18
Number: 1
ISSN: 0324-721X
Page Range: pp. 23-46
Language: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 45-46. ; ö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. 16. 10:54

Actions (login required)

View Item View Item