The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538)
From MaRDI portal
scientific article; zbMATH DE number 7199600
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ |
scientific article; zbMATH DE number 7199600 |
Statements
12 May 2020
0 references
repetition threshold
0 references
factor complexity
0 references
combinatorial complexity
0 references
repetitions in words
0 references
Dejean conjecture
0 references
math.CO
0 references
cs.DM
0 references
0 references
