Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 6, Pages 49–55 (Mi da711)  
This article is cited in 1 scientific paper (total 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
Full-text PDF (241 kB) Citations (1)
References:
PDF
HTML
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.
Received: 27.03.2012
Revised: 23.08.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 2, Pages 229–233
DOI: https://doi.org/10.1134/S1990478913020129
Bibliographic databases:
Document Type: Article
UDC: 519.714
Language: Russian
Citation: Yu. V. Merekin, “The Shannon function of computation of the Arnold complexity of length $2^n$ binary words”, Diskretn. Anal. Issled. Oper., 19:6 (2012), 49–55; J. Appl. Industr. Math., 7:2 (2013), 229–233
Citation in format AMSBIB
\Bibitem{Mer12}
\by Yu.~V.~Merekin
\paper The Shannon function of computation of the Arnold complexity of length $2^n$ binary words
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 6
\pages 49--55
\mathnet{http://mi.mathnet.ru/da711}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3076913}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 2
\pages 229--233
\crossref{https://doi.org/10.1134/S1990478913020129}
Linking options:
  • https://www.mathnet.ru/eng/da711
  • https://www.mathnet.ru/eng/da/v19/i6/p49
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025