| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 18, Number 1, 2007>>> |
 Magyarul
|
Groups and Semigroups Defined by some Classes of Mealy Automata
Alexander S. Antonenko and Eugene L. Berkovich
Abstract (in LaTeX format)
Two classes of finite Mealy automata (automata without branches, slow-moving 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.
Kewords: finite automata, groups defined by automata, semigroups defined by automata, finite automaton transformations.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@ARTICLE{Antonenko:2007:ActaCybernetica,author = {Alexander S. Antonenko and Eugene L. Berkovich},
title = {Groups and Semigroups Defined by some Classes of Mealy Automata},
journal = {Acta Cybernetica},
year = {2007},
volume = {18},
number = {1},
pages = {23--46},
abstract = {Two classes of finite Mealy automata (automata without branches, slow-moving 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.},
keywords = {finite automata, groups defined by automata, semigroups defined by automata, finite automaton transformations}
}