Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits

The problem of complexity of word assembly is studied. The complexity of a word means the minimal number of concatenation operations sufficient to obtain this word in the basis of oneletter words over a finite alphabet A ( repeated use of obtained words is permitted). Let LA ( n ) be the maximal complexity of words of length n over a finite alphabet A. In this paper we prove that Ш n ) = (l + (2 + 0 ( 1 ) ).