The number of binary rotation words.
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS(2014)
Abstract
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be Theta(n(4)). The result continues the line initiated by the formula for the number of all Sturmian words obtained by Lipatov [Problemy Kibernet. 39 (1982) 67-84], then independently by Mignosi [Theoret. Comput. Sci. 82 (1991) 71-84], and others.
MoreTranslated text
Key words
Rotation,rotation words,Sturmian words,subword complexity,total complexity
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined