On the computation of Arnold complexity of length 2ⁿ binary words

DOI10.1142/S179355711100023XMaRDI QIDQ3013879zbMATH OpenFDO

Authors Yuri Vladimirovich Merekin

Publication date 19 July 2011

Published in Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S179355711100023X

zbMATH Keywords

Arnold complexitybinary wordcomplexity words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the computational complexity of the Arnold complexity of binary words
• scientific article; zbMATH DE number 6466091
• The Shannon function for calculating the Arnold complexity of length 2 n binary words
• On the multiplicative complexity of binary words with a given number of units.
• scientific article; zbMATH DE number 3954821

Cited in

(5)

• Arithmetical complexity of symmetric D0L words.
• On the computational complexity of the Arnold complexity of binary words
• The Shannon function for calculating the Arnold complexity of length 2 n binary words
• scientific article; zbMATH DE number 6466091 (Why is no real title available?)
• A new estimate on complexity of binary generalized pseudostandard words

This page was built for publication: On the computation of Arnold complexity of length \(2^{n}\) binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013879)