This article is cited in 1 paper

The Shannon function of computation of the Arnold complexity of length $2^n$ binary words

Yu. V. Merekin

Sobolev Institute of Mathematics, Novosibirsk, Russia

Abstract: A method for the fast computation of the Arnold complexity of length $2^n$ 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$. Bibliogr. 5.

Keywords: binary word, word complexity, Arnold complexity, Shannon function.

UDC: 519.714

Received: 27.03.2012
Revised: 23.08.2012

 English version: Journal of Applied and Industrial Mathematics, 2013, 7:2, 229–233

Bibliographic databases:

•