The complexity of Fibonacci-like kneading sequences
The Fibonacci(-like) unimodal maps that have been studied in recent years give rise to a zeroentropy minimal subshift on two symbols, generated by the kneading sequence. In this paper we computed the word-complexity of such subshifts exactly. (c) 2005 Elsevier B.V. All rights reserved.
complexity unimodal map subshift fibonacci map