The complexity of fibonacci-like kneading sequences
Bruin, Henk and Volkova, Oksana (2005) The complexity of fibonacci-like kneading sequences Theoretical Computer Science . pp. 379-389.
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.
|Additional Information:||This is a pre-copy-editing, author-prepared, peer-reviewed PDF of an article published in Theoretical Computer Science 377, 379-389. © 2005 Elsevier Inc. All rights reserved.|
|Uncontrolled Keywords:||dynamical systems, topological entropy, piecewise isometries|
|Divisions:||Faculty of Engineering and Physical Sciences > Mathematics|
|Deposited By:||Mr Adam Field|
|Deposited On:||27 May 2010 15:42|
|Last Modified:||28 Sep 2012 10:50|
Repository Staff Only: item control page