Timeline for Generate a sequence with unique subsequences
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2013 at 8:43 | vote | accept | Joe Z. | ||
| Dec 15, 2013 at 8:37 | comment | added | Darren Stone | Thank you, @PeterTaylor. That makes sense. I've extended the sequence. | |
| Dec 15, 2013 at 8:37 | comment | added | Joe Z. | Hmm, didn't know that theorem existed. Looks like your answer will be the accepted one. | |
| Dec 15, 2013 at 8:36 | history | edited | Darren Stone | CC BY-SA 3.0 |
credit to @PeterTaylor
|
| Dec 15, 2013 at 7:55 | comment | added | Peter Taylor | Almost. De Bruijn sequences are cyclic, so you can copy the first 8 characters to the end to get a maximum-length non-cyclic string. | |
| Dec 15, 2013 at 6:59 | history | edited | Darren Stone | CC BY-SA 3.0 |
output
|
| Dec 15, 2013 at 6:29 | history | answered | Darren Stone | CC BY-SA 3.0 |