Volume 21, No 2, 2014, P. 59–75
UDC 519.714
Yu. V. Merekin
The Shannon function for calculating the Arnold complexity of length 2n binary words for arbitrary n
Abstract:
The exact value of the Shannon function for fast calculating the Arnold complexity of length 2n binary words is obtained for n = m2, n =m2 + m, and n = m2 + 2m, m ≥ 2. Thus the exact value of the Shannon function is determined for an arbitraryn.
Bibliogr. 6.
Keywords: binary word, complexity of word, Arnold complexity, Shannon function.
Merekin Yuriy Vladimirovich 1,2
1. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
e-mail: merekin@math.nsc.ru
|