Timeline for Cube-free infinite binary words
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2015 at 14:41 | comment | added | Benjamin Dickman | @JoelReyesNoche Ah, I see now that $x$ can be one or more letters; my erroneous count is for the restriction $|x| = 1$. Thanks for the clarification. | |
| Jan 9, 2015 at 12:45 | comment | added | JRN | @BenjaminDickman, the last time I looked, no exact formula for the number of finite binary cfw has been found, only bounds. The number of cubefree words of length n on two letters: oeis.org/A028445 | |
| Jan 9, 2015 at 8:40 | comment | added | Benjamin Dickman | @JoelReyesNoche and OP: w.r.t. (3) - Isn't the number of finite binary cfw of length $n$ just twice the $(n+1)$st Fibonacci number? | |
| May 27, 2012 at 15:15 | vote | accept | JRN | ||
| Aug 19, 2011 at 5:45 | history | answered | James Currie | CC BY-SA 3.0 |