Article ID Journal Published Year Pages File Type
9657869 Theoretical Computer Science 2005 11 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The complexity of Fibonacci-like kneading sequences
Authors
, ,