A lower bound for the arithmetical complexity of Sturmian words

zbMath1125.68091MaRDI QIDQ2498100

Anna E. Frid

Publication date: 24 August 2006

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/53574

zbMATH Keywords

infinite wordssequence entropypossible growth of arithmetical complexitysequences with minimal block growth

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (3)

On the arithmetical complexity of Sturmian words ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity

This page was built for publication: A lower bound for the arithmetical complexity of Sturmian words