A lower bound for the arithmetical complexity of Sturmian words
From MaRDI portal
Publication:2498100
zbMath1125.68091MaRDI QIDQ2498100
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
infinite wordssequence entropypossible growth of arithmetical complexitysequences with minimal block growth
Related Items
On the arithmetical complexity of Sturmian words, On possible growths of arithmetical complexity, Sequences of low arithmetical complexity