Geodesic
A lower bound on complexity for schemes of the concatenation of words
Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 1, pp. 52-56 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DA_1996_3_1_a4,
     author = {Yu. V. Merekin},
     title = {A~lower bound on complexity for schemes of the concatenation of words},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {52--56},
     year = {1996},
     volume = {3},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1996_3_1_a4/}
}
TY  - JOUR
AU  - Yu. V. Merekin
TI  - A lower bound on complexity for schemes of the concatenation of words
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1996
SP  - 52
EP  - 56
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DA_1996_3_1_a4/
LA  - ru
ID  - DA_1996_3_1_a4
ER  - 
%0 Journal Article
%A Yu. V. Merekin
%T A lower bound on complexity for schemes of the concatenation of words
%J Diskretnyj analiz i issledovanie operacij
%D 1996
%P 52-56
%V 3
%N 1
%U http://geodesic.mathdoc.fr/item/DA_1996_3_1_a4/
%G ru
%F DA_1996_3_1_a4
Yu. V. Merekin. A lower bound on complexity for schemes of the concatenation of words. Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 1, pp. 52-56. http://geodesic.mathdoc.fr/item/DA_1996_3_1_a4/