On the entropy and letter frequencies of ternary square-free words

zbMath1104.68090arXivmath/0302302MaRDI QIDQ1883623

Christoph Richard, Uwe Grimm

Publication date: 13 October 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Related Items (10)

Letter frequency in infinite repetition-free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Mixing properties and entropy bounds of a family of Pisot random substitutions ⋮ A family of formulas with reversal of high avoidability index ⋮ Growth properties of power-free languages ⋮ Growth of repetition-free words -- a review ⋮ Growth rates of complexity of power-free languages ⋮ Dejean's conjecture and letter frequency ⋮ Dejean's conjecture and letter frequency ⋮ Growth rates of power-free languages

This page was built for publication: On the entropy and letter frequencies of ternary square-free words