Timeline for Write the shortest code to match a tail-repeating string where one character falls off the head in each repetition
Current License: CC BY-SA 3.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 27, 2019 at 13:11 | answer | added | att | timeline score: 1 | |
| Jun 17, 2019 at 13:43 | vote | accept | Thomas Dignan | ||
| Jun 17, 2019 at 8:21 | history | edited | Unrelated String |
edited tags
|
|
| Jun 17, 2019 at 8:20 | answer | added | Unrelated String | timeline score: 2 | |
| Apr 2, 2016 at 9:35 | answer | added | Leaky Nun | timeline score: 2 | |
| Apr 11, 2012 at 20:00 | history | edited | Gaffi |
edited tags
|
|
| Apr 11, 2012 at 19:04 | answer | added | l0n3sh4rk | timeline score: 2 | |
| Apr 11, 2012 at 16:59 | review | Suggested edits | |||
| Apr 11, 2012 at 19:35 | |||||
| Apr 11, 2012 at 14:35 | answer | added | Gaffi | timeline score: 2 | |
| Mar 29, 2012 at 3:14 | answer | added | user unknown | timeline score: 1 | |
| Mar 29, 2012 at 2:14 | answer | added | user unknown | timeline score: 1 | |
| Mar 28, 2012 at 2:51 | answer | added | PhiNotPi | timeline score: 1 | |
| Jan 2, 2012 at 19:11 | answer | added | hammar | timeline score: 3 | |
| Jan 1, 2012 at 5:23 | history | tweeted | twitter.com/#!/StackCodeGolf/status/153345662270967808 | ||
| Jan 1, 2012 at 1:30 | vote | accept | Thomas Dignan | ||
| Jun 17, 2019 at 13:43 | |||||
| Jan 1, 2012 at 1:30 | vote | accept | Thomas Dignan | ||
| Jan 1, 2012 at 1:30 | |||||
| Dec 31, 2011 at 11:30 | comment | added | Peter Taylor |
Assume we have defined an alphabet. Let e denote the empty word, a denote a letter in the alphabet, and w denote a word over the alphabet. Define a function f from words of the alphabet to words of the alphabet recursively as f(e) = e and f(aw) = aw f(w). Define the language L over the alphabet as the set of words l for which there exists a word w such that l = f(w). The language you're asking us to accept is the words in L of length at least two, but that's an arbitrary additional constraint.
|
|
| Dec 31, 2011 at 8:21 | history | edited | Thomas Dignan | CC BY-SA 3.0 |
added 294 characters in body
|
| Dec 30, 2011 at 22:10 | answer | added | Peter Taylor | timeline score: 4 | |
| Dec 30, 2011 at 13:43 | comment | added | Thomas Dignan | you may be right about this, I would be interested to see someone formalize it | |
| Dec 30, 2011 at 12:29 | comment | added | Peter Taylor |
Surely x should be accepted? The first string is x; the second is the empty string, so end iteration.
|
|
| Dec 30, 2011 at 11:24 | answer | added | st0le | timeline score: 5 | |
| Dec 30, 2011 at 10:44 | answer | added | J B | timeline score: 3 | |
| Dec 30, 2011 at 10:00 | answer | added | Howard | timeline score: 3 | |
| Dec 30, 2011 at 7:11 | answer | added | Thomas Dignan | timeline score: 0 | |
| Dec 30, 2011 at 5:11 | history | edited | Thomas Dignan | CC BY-SA 3.0 |
added 1 characters in body
|
| Dec 30, 2011 at 4:56 | history | edited | Thomas Dignan | CC BY-SA 3.0 |
added 98 characters in body
|
| Dec 30, 2011 at 4:50 | history | asked | Thomas Dignan | CC BY-SA 3.0 |