Complexity of infinite sequences with zero entropy

DOI10.4064/AA142-4-3MaRDI QIDQ3561034zbMATH OpenOpenAlexFDO

Authors Christian Mauduit, C. Moreira

Publication date 21 May 2010

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4064/aa142-4-3

zbMATH Keywords

combinatorics on wordsentropysymbolic complexity

Mathematics Subject Classification ID

Automata sequences (11B85) Symbolic dynamics (37B10) Topological entropy (37B40) Combinatorics on words (68R15)

Recommendations

• Entropy ratio for infinite sequences with positive entropy
• Complexity and fractal dimensions for infinite sequences with positive entropy
• An algorithm for the word entropy
• On the complexity of infinite sequences
• Sequence entropy and the maximal pattern complexity of infinite words

Cited in

(15)

• On the complexity of infinite sequences
• An algorithm for the word entropy
• Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
• Three complexity functions
• Bounds on the Kolmogorov complexity function for infinite words
• Cost and dimension of words of zero topological entropy
• Drunken man infinite words complexity
• Compressibility of Deterministic and Random Infinite Sequences
• Entropy ratio for infinite sequences with positive entropy
• Complexity and fractal dimensions for infinite sequences with positive entropy
• Factor complexity
• Statistical estimation of the structure of a finite population
• A Pansiot-type subword complexity theorem for automorphisms of free groups
• The heinis spectrum has non-empty interior
• Behavior of various complexity functions

This page was built for publication: Complexity of infinite sequences with zero entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561034)