The number of binary cube-free words of length up to 47 and their numerical analysis

DOI10.1080/10236199908808196zbMath0939.05007OpenAlexW2064936687MaRDI QIDQ4700079

Anne E. Edlin

Publication date: 5 July 2000

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10236199908808196

zbMATH Keywords

binary cube-free words

Mathematics Subject Classification ID

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

Related Items (6)

On the entropy and letter frequencies of powerfree words ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ Avoiding or Limiting Regularities in Words ⋮ Growth of repetition-free words -- a review ⋮ Growth rates of complexity of power-free languages ⋮ Growth rates of power-free languages

Uses Software

• Maple

Cites Work

• The Goulden—Jackson cluster method: extensions, applications and implementations

This page was built for publication: The number of binary cube-free words of length up to 47 and their numerical analysis