No CrossRef data available.
Article contents
A word of low complexity without uniform frequencies
Published online by Cambridge University Press: 29 May 2023
Abstract
In this paper, we construct a uniformly recurrent infinite word of low complexity without uniform frequencies of letters. This shows the optimality of a bound of Boshernitzan, which gives a sufficient condition for a uniformly recurrent infinite word to admit uniform frequencies.
MSC classification
- Type
- Original Article
- Information
- Copyright
- © The Author(s), 2023. Published by Cambridge University Press