Symbolic dynamics, entropy and complexity of the feigenbaum map at the accumulation point

Abstract

This paper aims to make further contributions to the exploration of the symbolic dynamics generated by the logistic map at Feigenbaum accumulation point. In particular we are interested in the grammar of these sequences; completing earlier studies we study here arbitrary partitions also. Our main aim is the investigation of the special grammars which characterize the long-range correlations between letters. Considering these sequences as standard examples of a complex system, we introduce and discuss a complexity function derived from the conditional entropies. Further we discuss local predictabilities.