The complexity of Fibonacci-like kneading sequences

DOI10.1016/j.tcs.2005.02.001zbMath1077.37012OpenAlexW2009118891WikidataQ59184873 ScholiaQ59184873MaRDI QIDQ557842

O. Volkova, Henk Bruin

Publication date: 30 June 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://epubs.surrey.ac.uk/1549/1/fulltext.pdf

zbMATH Keywords

complexityunimodal mapsubshiftFibonacci map

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10) Dynamical systems involving maps of the interval (37E05)

Related Items (1)

The topological complexity of Cantor attractors for unimodal interval maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• Complexity and special factors
• Complexity of sequences and dynamical systems
• A characterization of substitutive sequences using return words
• Fraenkel's conjecture for six sequences
• Symbolic analysis of finite words: the complexity function
• Wild Cantor attractors exist
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• The Fibonacci Unimodal Map
• Adding machines and wild attractors
• Topological conditions for the existence of absorbing Cantor sets
• Minimal Cantor Systems and Unimodal Maps
• Linearly recurrent subshifts have a finite number of non-periodic subshift factors
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Topics from One-Dimensional Dynamics
• An Introduction to Symbolic Dynamics and Coding
• Rank and symbolic complexity
• Topological Entropy

This page was built for publication: The complexity of Fibonacci-like kneading sequences