Timeline for What is the fastest way to count square-free words?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 21, 2012 at 0:46 | history | edited | Dr. belisarius | CC BY-SA 3.0 | added 182 characters in body |
| Aug 21, 2012 at 0:39 | comment | added | Dr. belisarius | @J.M. I was going to post Timing@StringFreeQ[benchmark, RegularExpression["(.+)\\1"]] | |
| Aug 21, 2012 at 0:34 | comment | added | J. M.'s missing motivation | I used squareFreeQ[str_] := StringFreeQ[str, RegularExpression["(\\d+)\\1"]] myself... | |
| Aug 20, 2012 at 23:18 | history | edited | Dr. belisarius | CC BY-SA 3.0 | added 3 characters in body |
| Aug 20, 2012 at 22:44 | comment | added | Dr. belisarius | @R.M I explained the first one. The second is the same with a variable {1,1000} thingy | |
| Aug 20, 2012 at 22:43 | history | edited | Dr. belisarius | CC BY-SA 3.0 | added 410 characters in body |
| Aug 20, 2012 at 22:36 | comment | added | rm -rf♦ | Yes, I can confirm it is true. Could you also break down the regex and explain? Btw, you need to add a Not to get the OP's definition | |
| Aug 20, 2012 at 22:30 | history | edited | Dr. belisarius | CC BY-SA 3.0 | added 42 characters in body; added 74 characters in body |
| Aug 20, 2012 at 22:25 | history | edited | Dr. belisarius | CC BY-SA 3.0 | added 492 characters in body |
| Aug 20, 2012 at 22:04 | review | Low quality posts | |||
| Aug 20, 2012 at 22:14 | |||||
| Aug 20, 2012 at 22:01 | history | answered | Dr. belisarius | CC BY-SA 3.0 |