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

zbMATH Open1289.68065arXiv1209.4700MaRDI QIDQ376820FDOQ376820

Authors: Yuri Vladimirovich Merekin 

Publication date: 19 November 2013

Published in: Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Abstract: For fast computation of the Arnold complexity of length $2^n$ binary words we obtain an upper bound for the Shannon function $Sh(n)$

Full work available at URL: https://arxiv.org/abs/1209.4700

zbMATH Keywords

binary wordArnold complexityword complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (3)

• Title not available (Why is that?)
• The Shannon function for calculating the Arnold complexity of length 2 n binary words
• A new estimate on complexity of binary generalized pseudostandard words

This page was built for publication: Fast computation of the 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 Q376820)