The Kolmogorov complexity of infinite words
Theoretical Computer Science
De Bruijn sequences and De Bruijn graphs for a general language
Information Processing Letters
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Entropy and data compression schemes
IEEE Transactions on Information Theory
| Hi-index | 5.23 |
We consider continuous self-maps of compact metric spaces, and for each point of the space we define the notion of eulerian entropy by considering the exponential growth rate of complexity in the initial chunks of the orbit of the point. We show that eulerian entropy is constant on a residual subset for transitive dynamical systems. For elements in the shift dynamical system we define an equivalent notion named non-repetitive subword complexity, and show that for a large class of mixing subshifts of finite type, the set of points for which the non-repetitive subword complexity is equal to the topological entropy is residual. If f is either a transitive interval map or an infinite transitive subshift of finite type, we establish that there is t@?N such that the eulerian entropy of f^t is a positive constant that is attained on a residual set of points.