|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2009, Number 9, Pages 36–45
(Mi ivm3064)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Automata all of whose congruences are inner
V. N. Salii Chair of Theoretical Foundations of Computer Security and Cryptography, Saratov State University, Saratov, Russia
Abstract:
A congruence on an automaton $\mathbf A$ is called inner if it is the kernel of a certain endomorphism on $\mathbf A$. We propose a characterization of automata, all of whose congruences are inner.
Keywords:
automaton, congruence, inner congruence, endomorphism.
Received: 04.05.2005 Revised: 06.07.2007
Citation:
V. N. Salii, “Automata all of whose congruences are inner”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 9, 36–45; Russian Math. (Iz. VUZ), 53:9 (2009), 29–37
Linking options:
https://www.mathnet.ru/eng/ivm3064 https://www.mathnet.ru/eng/ivm/y2009/i9/p36
|
Statistics & downloads: |
Abstract page: | 435 | Full-text PDF : | 106 | References: | 67 | First page: | 7 |
|