Talk:Fibonacci word: Difference between revisions
Content added Content deleted
No edit summary |
mNo edit summary |
||
| Line 6: | Line 6: | ||
the lengths of those substrings are going to get you in trouble (again) with |
the lengths of those substrings are going to get you in trouble (again) with |
||
Them That Be. (I stopped after 20 because the algorithm I use for locating |
Them That Be. (I stopped after 20 because the algorithm I use for locating |
||
repeated substrings is pretty naive and slow - hmmm, maybe |
repeated substrings is pretty naive and slow - hmmm, maybe <i>that</i> should be a separate |
||
RosettaCode task?* |
RosettaCode task?* |
||
Revision as of 21:03, 13 July 2013
Uh, are you sure that any of the Fibonacci words actually have rep-strings?
- It would seem not. I have replaced rep string with repeated substring.--Nigel Galloway (talk) 12:09, 13 July 2013 (UTC)
I'm not sure that's much better. I've modified the Icon/Unicon solution to print the lengths of the longest repeated substring for the first 20 Fibonacci Words. It looks like the lengths of those substrings are going to get you in trouble (again) with Them That Be. (I stopped after 20 because the algorithm I use for locating repeated substrings is pretty naive and slow - hmmm, maybe that should be a separate RosettaCode task?*