Return time complexity of Sturmian sequences

DOI10.1016/J.TCS.2011.02.004zbMath1221.68181OpenAlexW2020213212MaRDI QIDQ551163

Dong Han Kim

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.004

zbMATH Keywords

Fibonacci wordfirst return timeSturmian sequencecomplexity of sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers ⋮ A characterization of eventual periodicity

Cites Work

• The first return time properties of an irrational rotation
• Entropy and data compression schemes
• Sequences with minimal block growth
• Unnamed Item
• Unnamed Item

This page was built for publication: Return time complexity of Sturmian sequences