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/