RUS
ENG
Full version
JOURNALS
// Diskretnyi Analiz i Issledovanie Operatsii
// Archive
Diskretn. Anal. Issled. Oper.,
1996
Volume 3,
Issue 1,
Pages
52–56
(Mi da427)
This article is cited in
10
papers
A lower bound on complexity for schemes of the concatenation of words
Yu. V. Merekin
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
UDC:
519.714
Received:
05.01.1996
Fulltext:
PDF file (520 kB)
Cited by
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026
Fulltext:
PDF file (520 kB)