Groups and semigroups defined by some classes of mealy automata

Authors

  • Aleksander S. Antonenko
  • Eugene L. Berkovič

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2007-01-01

How to Cite

Antonenko, A. S., & Berkovič, E. L. (2007). Groups and semigroups defined by some classes of mealy automata. Acta Cybernetica, 18(1), 23–46. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3704

Issue

Section

Regular articles