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. Acta cybernetica, (18) 1. pp. 23-46. (2007)

[img] Cikk, tanulmány, mű

Download (237kB)


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
Event Title: Kalmár Workshop on Logic in Computer Science, 2003, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2007
Volume: 18
Number: 1
Page Range: pp. 23-46
ISSN: 0324-721X
Language: angol
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 45-46.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 13:33

Actions (login required)

View Item View Item