Abstract
A congruence on an automaton A is called inner if it is the kernel of a certain endomorphism on A. We propose a characterization of automata, all of whose congruences are inner.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Fuchs, A. Kertesz, and T. Szele, “On Abelian Groups in which Every Homomorphic Image can be Embedded,” ActaMath. Hung. 7(3–4), 467–475 (1956).
I. Rival and B. Sands, “Weak Embeddings and Embeddings of Finite Distributive Lattices,” Arch. Math. 26(1), 346–352 (1975).
T. S. Blyth, J. Fang, and H. J. Silva, “The Endomorphism Kernel Property in Finite Distributive Lattices and de Morgan Algebras,” Commun. Algebra 32(6), 2225–2242 (2004).
A.V. Kireeva, “Subgraphs and Factorizations of Functional Graphs,” Usp. Mat. Nauk 48(2), 183–184 (1993).
A. M. Bogomolov and V. N. Salii, Algebraic Foundations of the Theory of Discrete Systems (Nauka, Moscow, 1997) [in Russian].
V. N. Salii, “About Inner Congruences of Automata,” in Proceedings of International Algebraic Conference dedicated to the 250th Anniversary of Moscow University (Moscow, 2004), pp. 109–110.
V. N. Salii Universal Algebra and Automata (Saratovsk. Univ., Saratov, 1988) [in Russian].
J. Fang, “An Extended Ockham Algebra with Endomorphism Kernel Property,” Acta Math. Sinica 23(9), 1611–1620 (2007).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.N. Salii, 2009, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, No. 9, pp. 36–45.
About this article
Cite this article
Salii, V.N. Automata all of whose congruences are inner. Russ Math. 53, 29–37 (2009). https://doi.org/10.3103/S1066369X09090047
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X09090047