Automaton mappings of periodic sequences that do not propagate distortions
Diskretnaya Matematika, Tome 13 (2001) no. 3, pp. 42-56
We describe the reduced permutational automata realizing the mappings of a set of periodic input sequences into a set of periodic output sequences which preserve or do not increase the introduced in the paper distance between periodic sequences.
@article{DM_2001_13_3_a2,
author = {A. V. Babash},
title = {Automaton mappings of periodic sequences that do not propagate distortions},
journal = {Diskretnaya Matematika},
pages = {42--56},
year = {2001},
volume = {13},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2001_13_3_a2/}
}
A. V. Babash. Automaton mappings of periodic sequences that do not propagate distortions. Diskretnaya Matematika, Tome 13 (2001) no. 3, pp. 42-56. http://geodesic.mathdoc.fr/item/DM_2001_13_3_a2/
[1] Babash A. V., Glukhov M. M., Shankin G. P., “O preobrazovaniyakh mnozhestva slov v konechnom alfavite, ne razmnozhayuschikh iskazhenii”, Diskretnaya matematika, 9:3 (1997), 3–19 | MR | Zbl
[2] Babash A. V., “Priblizhennye modeli perestanovochnykh avtomatov”, Diskretnaya matematika, 9:1 (1997), 103–122 | MR | Zbl
[3] Gill A., Vvedenie v teoriyu konechnykh avtomatov, Nauka, Moskva, 1986 | MR