Talk:Rep-string: Difference between revisions
Content added Content deleted
m (→Clarification: added italics. -- ~~~~) |
(→Clarification: Critical point: repetition is required) |
||
| Line 16: | Line 16: | ||
::By the way, almost all programming examples have incorrect output, showing strings to be non-reps, whilest in fact, they are. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 07:22, 13 May 2013 (UTC) |
::By the way, almost all programming examples have incorrect output, showing strings to be non-reps, whilest in fact, they are. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 07:22, 13 May 2013 (UTC) |
||
::: To get sane output, you need the restriction that ''the repeating unit must be no more than half of the length of the input string''. Otherwise, the longest “repeating” unit is potentially the whole string, which is nuts. Any decision procedure for this needs to be able to reject a string as well as to find the repetition if it exists. (I'll update the task description momentarily.) –[[User:Dkf|Donal Fellows]] ([[User talk:Dkf|talk]]) 08:26, 13 May 2013 (UTC) |
|||
==Reason for update request== |
==Reason for update request== |
||