论文信息 - The Number of Runs in a Ternary Word

The Number of Runs in a Ternary Word

It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in "ternary words", in which every small factor contains all three letters.

[1] Lucian Ilie,et al. Maximal repetitions in strings , 2008, J. Comput. Syst. Sci..

[2] Mathieu Giraud,et al. Asymptotic behavior of the numbers of runs and microruns , 2009, Inf. Comput..

[3] Jamie Simpson. Modified Padovan words and the maximum number of runs in a word , 2010, Australas. J Comb..

[4] Gad M. Landau,et al. Prague Stringology Conference 2008 , 2008 .

[5] Simon J. Puglisi,et al. The expected number of runs in a word , 2008, Australas. J Comb..

[6] Gregory Kucherov,et al. On Maximal Repetitions in Words , 1999, FCT.

[7] Lucian Ilie,et al. Towards a Solution to the "Runs" Conjecture , 2008, CPM.

[8] Hideo Bannai,et al. New Lower Bounds for the Maximum Number of Runs in a String , 2008, Stringology.