The complexity of Fibonacci-like kneading sequences

Authors:
H. Bruin;O. Volkova
Affiliations:
Department of Mathematics and Statistics, University of Surrey, Guildford GU2 7XH, UK;Institute of Mathematics, National Academy of Sciences of Ukraine, Tereshchenkivska Street 3, 01601 Kiev, Ukraine
Venue:
Theoretical Computer Science
Year:
2005

Citing 4
Cited 0

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
A characterization of substitutive sequences using return words

Discrete Mathematics
Fraenkel's conjecture for six sequences

Discrete Mathematics
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés

Proceedings of the 11th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	5.23

Visualization

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.