Abstract
Automata theory is a branch of mathematical cybernetics that studies data conversion devices involved in many applied problems. This article considers automata with no output signals, called semiautomata. With regard to specific problems, semiautomata (whose sets of states are endowed with an additional mathematical structure consistent with the semiautomaton’s transition function) are considered. This study investigates semiautomata over graphs (known as graphic semiautomata), whose sets of states are endowed with the mathematical structure of a graphic. Universal graphic semiautomaton Atm(G) is the universally attracting object in the category of semiautomata whose sets of states are endowed with the structure of graph G, preserved by the transition function of the semiautomaton. The semigroup of input signals of that semiautomaton has the form S(G) = End G. This study considers the problem of relatively elementary definability of the class of universal graphic semiautomata over reflexive quasi-acyclic graphs in the class of semigroups, as well as the applications of relatively elementary definability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
A. G. Pinus and Yu. M. Vazhenin, “Elementary classification and decidability of theories of derived structures,” Russ. Math. Surv. 60 (3), 395–432 (2005). https://doi.org/10.1070/RM2005v060n03ABEH000847
A. G. Pinus, “On the elementary equivalence of derived structures of free lattices,” Russ. Math. 46 (5), 42–45 (2002). https://doi.org/10.1016/0021-8693(89)90224-X
A. G. Pinus, “Elementary equivalence of derived structures of free semigroups, unars, and groups,” Algebra Logic 43 (6), 408–417 (2004). https://doi.org/10.1023/B:ALLO.0000048829.60182.48
A. G. Pinus, “Elementary equivalence for the lattices of subalgebras and automorphism groups of free algebras,” Sib. Math. J. 49 (4), 692–695 (2008). https://doi.org/10.1007/s11202-008-0066-0
L. M. Gluskin, “Semigroups of isotonic transformations,” Usp. Mat. Nauk 16 (5), 157–162 (1961).
L. M. Gluskin, “Semigroups and rings of endomorphisms of linear spaces,” Izv. Akad. Nauk SSSR. Ser. Mat. 23 (6), 841–870 (1959).
E. I. Bunina and A. V. Mikhalev, “Elementary equivalence of endomorphism rings of Abelian p-groups,” J. Math. Sci. 137 (6), 5212–5274 (2006). https://doi.org/10.1007/s10958-006-0296-2
F. A. Murzin, “Elementary equivalence of rings of continuous functions,” in The Theory of Models and Applications (Kaz. Gos. Univ., Alma-Ata, 1980), pp. 72–74 [in Russian].
Yu. L. Ershov, Decidability Problems and Constructive Models (Nauka, Moscow, 1980) [in Russian].
B. I. Plotkin, L. Ya. Greenglaz, and A. A. Gvaramia, Elements of Algebraic Theory of Automata (Vysshaya Shkola, Moscow, 1994) [in Russian].
R. Lidl and G. Pilz, Applied Abstract Algebra (Springer, New York, 1984).
Yu. M. Vazhenin, “The elementary definability and elementary characterizability of classes of reflexive graphs,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 7, 3–11 (1972).
A. M. Bogomolov and V. N. Salii, Algebraic Foundations of the Theory of Discrete Systems (Nauka, Moscow, 1997) [in Russian].
F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969).
Yu. M. Vazhenin, “Elementary properties of semigroups of transformations of ordered sets,” Algebra Logika 9 (3), 281–301 (1970).
ACKNOWLEDGMENTS
I thank a reviewer for helpful feedback and research advisor Prof. V.A. Molchanov for help with problem statement and overall assistance.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author declares that he has no conflicts of interest.
Additional information
Translated by A. Ovchinnikova
About this article
Cite this article
Farakhutdinov, R.A. Relatively Elementary Definability of the Class of Universal Graphic Semiautomata in the Class of Semigroups. Russ Math. 66, 62–70 (2022). https://doi.org/10.3103/S1066369X22010029
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X22010029