Volume 19, No 6, 2012, P. 49-55
Yu. V. Merekin
The Shannon function of computation of the Arnold complexity of length 2n binary words
A method for the fast computation of the Arnold complexity of length 2n binary words has been recently proposed by the author. Based on this method, an exact value of the Shannon function is obtained for almost all n.
Keywords: binary word, word complexity, Arnold complexity, Shannon function.
Merekin Yuri Vladimirovich 1
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia