*-Sturmian words and complexity

DOI10.5802/jtnb.426zbMath1155.68479OpenAlexW2322480417MaRDI QIDQ558168

Izumi Nakashima, Shin-ichi Yasutomi, Jun-ichi Tamura

Publication date: 30 June 2005

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2003__15_3_767_0

zbMATH Keywords

complexitySturmian wordsapproximation of rational linesinfinite occurrences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Symbolic dynamics (37B10)

Related Items

On the arithmetical complexity of Sturmian words ⋮ Sturmian and Episturmian Words ⋮ Language structure of pattern Sturmian words ⋮ Complexity for finite factors of infinite sequences ⋮ On possible growths of arithmetical complexity ⋮ Sequences of low arithmetical complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Modified complexity and *-Sturmian word
• Sequences with subword complexity \(2n\)
• Complexity of trajectories in rectangular billiards
• Représentation géométrique de suites de complexité $2n+1$
• Complexity of sequences defined by billiard in the cube
• Descriptions of the Characteristic Sequence of an Irrational
• The continued fraction expansion of α with μ(α) = 3
• Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$
• Sequences with minimal block growth