RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 2009 Number 9, Pages 36–45 (Mi ivm3064)

This article is cited 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.

UDC: 512.5

Received: 04.05.2005
Revised: 06.07.2007


 English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2009, 53:9, 29–37

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024