Geodesic
Automaton Barriers
Matematičeskie zametki, Tome 91 (2012) no. 5, pp. 667-673.

Voir la notice de l'article provenant de la source Math-Net.Ru

An upper bound for the minimal length of words which can be obtained at the output of an automaton with binary input and output alphabets is improved.
Keywords: finite automaton, automaton barrier, barrier length, Moore machine, pseudorandom number generator.
Mots-clés : Medvedev automaton 
@article{MZM_2012_91_5_a2,
     author = {A. V. Babash},
     title = {Automaton {Barriers}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {667--673},
     publisher = {mathdoc},
     volume = {91},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2012_91_5_a2/}
}
TY  - JOUR
AU  - A. V. Babash
TI  - Automaton Barriers
JO  - Matematičeskie zametki
PY  - 2012
SP  - 667
EP  - 673
VL  - 91
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2012_91_5_a2/
LA  - ru
ID  - MZM_2012_91_5_a2
ER  - 
%0 Journal Article
%A A. V. Babash
%T Automaton Barriers
%J Matematičeskie zametki
%D 2012
%P 667-673
%V 91
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2012_91_5_a2/
%G ru
%F MZM_2012_91_5_a2
A. V. Babash. Automaton Barriers. Matematičeskie zametki, Tome 91 (2012) no. 5, pp. 667-673. http://geodesic.mathdoc.fr/item/MZM_2012_91_5_a2/

[1] A. A. Varfolomeev, A. E. Zhukov, M. A. Pudovkina, Potochnye kriptoskhemy. Osnovnye svoistva i metody analiza stoikosti, MII, M., 2000

[2] A. P. Alferov, A. Yu. Zubov, A. S. Kuzmin, A. V. Cheremushkin, Osnovy kriptografii, Gelios ARV, M., 2002

[3] F. P. Preparata, “Convolutional transformations of binary sequences: Boolean functions and their resynchronizing properties”, IEEE Trans. Electron. Comput., 15:6 (1966), 898–908 | DOI

[4] S. N. Sumarokov, “Zaprety dvoichnykh funktsii i obratimost dlya odnogo klassa kodiruyuschikh ustroistv”, Obozrenie prikladnoi i promyshlennoi matematiki, 1:1 (1994), 33–55 | Zbl

[5] B. A. Trakhtenbrot, Ya. M. Barzdin, Konechnye avtomaty (povedenie i sintez), Nauka, M., 1970 | MR | Zbl

[6] O. B. Lupanov, “O sravnenii dvukh tipov konechnykh istochnikov”, Problemy kibernetiki, 9, Fizmatgiz, M., 1963, 321–326 | Zbl

[7] Yu. L. Ershov, “O gipoteze V. A. Uspenskogo”, Algebra i logika. Sem., 1:4 (1962), 45–48 | MR | Zbl

[8] V. S. Grinberg, “Determinizatsiya sistem grafov i sintez konechnykh avtomatov”, Sib. matem. zhurn., 7:6 (1966), 1259–1267 | MR | Zbl

[9] G. F. Rose, “Output completeness in sequential machines”, Proc. Amer. Math. Soc., 13:4 (1962), 611–614 | DOI | MR | Zbl

[10] V. B. Kudryavtsev, S. V. Aleshin, A. S. Podkolzin, Elementy teorii avtomatov, Izd-vo Mosk. gos. un-ta, M., 1978

[11] A. S. Podkolzin, “O slozhnosti raspoznavaniya avtomatov-generatorov”, Diskretnyi analiz, 21, Novosibirsk, 1972, 31–61 | MR | Zbl

[12] A. Gill, Vvedenie v teoriyu konechnykh avtomatov, Nauka, M., 1966 | MR | Zbl

[13] G. P. Gavrilov, A. A. Sapozhenko, Zadachi i uprazhneniya po kursu diskretnoi matematiki, Nauka, M., 1992 | MR | Zbl