Abstract
We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential. The first one is rather simple but produces a word which is not uniformly recurrent. The second construction, more involved, produces uniformly recurrent words and allows to choose the growth of the complexity function in a large family.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
