CPC
2010
15 years 3 months ago
2010
Define the Linus sequence Ln for n 1 as a 0-1 sequence with L1 = 0, and Ln chosen so as to minimize the length of the longest immediately repeated block Ln-2r+1 . . . Ln-r = Ln-r...