id: 05925632
dt: j
an: 05925632
au: Merekin, Yu.V.
ti: On the computation of Arnold complexity of length $2^{n}$ binary words.
so: Asian-Eur. J. Math. 4, No. 2, 295-300 (2011).
py: 2011
pu: World Scientific, Singapore
la: EN
cc: 
ut: binary word; complexity words; Arnold complexity
ci: 
li: doi:10.1142/S179355711100023X
ab: Summary: Among all binary words $w$ of length $2^{n}$, $n \geq 1$, we find
    the words whose Arnold complexity can be calculated by counting the
    number of occurrences of ones in certain disjoint fragments of $w$.
rv: