Timeline for An inequality related to the number of binary strings with no fixed substring
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Dec 3, 2013 at 1:28 | vote | accept | Jernej | ||
| Dec 2, 2013 at 20:54 | answer | added | Jay Pantone | timeline score: 9 | |
| Dec 2, 2013 at 12:08 | answer | added | Thanh Vu | timeline score: 0 | |
| Dec 2, 2013 at 10:59 | answer | added | Ben Barber | timeline score: 2 | |
| Dec 2, 2013 at 9:38 | comment | added | Pietro Majer | @Mariano: I think $|f|$ denotes the length of the string $f$ . | |
| Dec 2, 2013 at 8:12 | comment | added | Mariano Suárez-Álvarez | What do you mean by $|f|$? | |
| Dec 2, 2013 at 4:10 | history | edited | Jernej | CC BY-SA 3.0 |
added 1 characters in body
|
| Dec 2, 2013 at 0:55 | history | asked | Jernej | CC BY-SA 3.0 |