Fast computation of the Arnold complexity of length \(2^{n}\) binary words

zbMath1289.68065arXiv1209.4700MaRDI QIDQ376820

Yuri Vladimirovich Merekin

Publication date: 19 November 2013

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

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

zbMATH Keywords

word complexitybinary wordArnold complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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