Abstract
We obtain necessary and sufficient conditions under which the representation of abstract automata in terms of finite groups is consistent with the transition function of an automaton. We obtain sufficient conditions under which the mapping of a free semigroup of an automaton into a group realized by a component of the representation is a homomorphism.
Similar content being viewed by others
REFERENCES
V. G. Skobelev, “Representation of automata by groups,” Ukr. Mat. Zh., 44, No.10, 1412–1416 (1992).
M. I. Kargapolov and Yu. I. Merzlyakov, Fundamentals of Group Theory [in Russian], Nauka, Moscow (1977).
A. I. Mal'tsev, Algebraic Systems [in Russian], Nauka, Moscow (1970).
B. A. Trakhtenbrot and Ya. M. Barzdin', Finite Automata (Behavior and Synthesis) [in Russian], Nauka, Moscow (1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Skobelev, V.G. Representation of Automata by Groups. II. Ukrainian Mathematical Journal 52, 1597–1605 (2000). https://doi.org/10.1023/A:1010405201956
Issue Date:
DOI: https://doi.org/10.1023/A:1010405201956