University of Surrey

Test tubes in the lab Research in the ATI Dance Research

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.

[img]
Preview
PDF
fulltext.pdf

Download (243kB)

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.

Item Type: Article
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
Depositing User: Mr Adam Field
Date Deposited: 27 May 2010 14:42
Last Modified: 23 Sep 2013 18:33
URI: http://epubs.surrey.ac.uk/id/eprint/1549

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800