On the homomorphisms of strongly connected finite automata into substitution automata
Matematičeskie voprosy kriptografii, Tome 2 (2011) no. 3, pp. 31-46
Cet article a éte moissonné depuis la source Math-Net.Ru
An approach to a description of homomorphisms of strongly connected finite automata into substitution automata is suggested. This approach is based on special homomorphisms such that their composition with homomorphism of an automaton considered into substitution automaton preserves the group of an image. By means of this approach for strongly connected automata a criterion is given for the existence of nontrivial substitutional homomorphic image wish commutative partial transition functions.
@article{MVK_2011_2_3_a1,
author = {I. A. Kruglov},
title = {On the homomorphisms of strongly connected finite automata into substitution automata},
journal = {Matemati\v{c}eskie voprosy kriptografii},
pages = {31--46},
year = {2011},
volume = {2},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MVK_2011_2_3_a1/}
}
I. A. Kruglov. On the homomorphisms of strongly connected finite automata into substitution automata. Matematičeskie voprosy kriptografii, Tome 2 (2011) no. 3, pp. 31-46. http://geodesic.mathdoc.fr/item/MVK_2011_2_3_a1/
[1] Bakhturin Yu. A., Osnovnye struktury sovremennoi algebry, Nauka, M., 1990, 320 pp. | MR | Zbl
[2] Brauer V., Vvedenie v teoriyu konechnykh avtomatov, Per. s nem., Radio i svyaz, M., 1987, 392 pp. | MR
[3] Sachkov V. N., “Veroyatnostnye preobrazovateli i pravilnye multigrafy, 1”, Trudy po diskretnoi matematike, 1, TVP, M., 1997, 227–250 | MR | Zbl