Abstract

The Fibonacci(-like) unimodal maps that have been studied in recent years give rise to a zero-entropy minimal subshift on two symbols, generated by the kneading sequence. In this paper we computed the word-complexity of such subshifts exactly.

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 call

Disclaimer: 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.