Groups and semigroups defined by some classes of mealy automata

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.

Elmentve itt :
Bibliográfiai részletek
Szerzők: Antonenko Aleksander S.
Berkovič Eugene L.
Dokumentumtípus: Cikk
Megjelent: 2007
Sorozat:Acta cybernetica 18 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12802
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:23-46
ISSN:0324-721X