NON-REPETITIVE SEQUENCES ON THREE SYMBOLS

DOI10.1093/qmath/34.2.145zbMath0528.05004OpenAlexW2030652989MaRDI QIDQ3309838

Jan Brinkhuis

Publication date: 1983

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/34.2.145

zbMATH Keywords

Hausdorff dimensionexponential growthnon-repetitive sequence

Mathematics Subject Classification ID

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

Related Items (16)

Repetition-free words ⋮ A proof of Dejean’s conjecture ⋮ On the structure and extendibility of \(k\)-power free words ⋮ On the entropy and letter frequencies of powerfree words ⋮ Non-repetitive words: Ages and essences ⋮ The number of binary words avoiding Abelian fourth powers grows exponentially ⋮ Square-free words obtained from prefixes by permutations ⋮ Growth problems for avoidable words ⋮ On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters ⋮ Growth properties of power-free languages ⋮ Relatively free semigroups of intermediate growth ⋮ Growth of repetition-free words -- a review ⋮ The entropy of square-free words ⋮ Pattern avoidance: themes and variations ⋮ The Goulden—Jackson cluster method: extensions, applications and implementations ⋮ Dejean's conjecture holds for N ≥ 27

This page was built for publication: NON-REPETITIVE SEQUENCES ON THREE SYMBOLS