On the entropy and letter frequencies of powerfree words

DOI10.3390/e10040590zbMath1179.68112arXiv0811.2119OpenAlexW3101113735MaRDI QIDQ845374

Uwe Grimm, Manuela Heuer

Publication date: 29 January 2010

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.2119

zbMATH Keywords

integer sequencescombinatorics on wordssymbolic sequencesentropy and information theory

Mathematics Subject Classification ID

Combinatorics on words (68R15) Measures of information, entropy (94A17) Symbolic dynamics (37B10) Automata sequences (11B85)

Related Items (1)

On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters

Uses Software

• JAN
• NAIVE
• DAVID_IAN
• JODO
• BLANKS
• SYMGJ
• SPGJ
• GJseries
• GJSAW
• GJsqfree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial versus exponential growth in repetition-free binary words
• Substitutions in dynamics, arithmetics and combinatorics
• Growth problems for avoidable words
• The entropy of square-free words
• A characterization of power-free morphisms
• Repetition-free words
• Substitution dynamical systems - spectral analysis
• Avoidable patterns in strings of symbols
• Sharp characterizations of squarefree morphisms
• On repetition-free binary words of minimal density
• Some results on \(k\)-power-free morphisms
• Uniformly growing k-th power-free homomorphisms
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• How many square occurrences must a binary sequence contain?
• On the entropy and letter frequencies of ternary square-free words
• Letter frequency in infinite repetition-free words
• Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms
• Growth of repetition-free words -- a review
• NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
• Open Problems in Pattern Avoidance
• TRACE MAPS, INVARIANTS, AND SOME OF THEIR APPLICATIONS
• Automatic Sequences
• The number of binary cube-free words of length up to 47 and their numerical analysis
• The Goulden—Jackson cluster method: extensions, applications and implementations
• Dejean's conjecture and letter frequency

This page was built for publication: On the entropy and letter frequencies of powerfree words