Automata all of whose congruences are inner
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2009), pp. 36-45
Voir la notice de l'article provenant de la source Math-Net.Ru
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
Mots-clés : endomorphism.
Mots-clés : endomorphism.
@article{IVM_2009_9_a3,
author = {V. N. Salii},
title = {Automata all of whose congruences are inner},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {36--45},
publisher = {mathdoc},
number = {9},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2009_9_a3/}
}
V. N. Salii. Automata all of whose congruences are inner. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 9 (2009), pp. 36-45. http://geodesic.mathdoc.fr/item/IVM_2009_9_a3/