TY - GEN
T1 - The number of runs in a ternary word
AU - Bannai, Hideo
AU - Giraud, Mathieu
AU - Kusano, Kazuhiko
AU - Matsubara, Wataru
AU - Shinohara, Ayumi
AU - Simpson, Jamie
PY - 2010/12/1
Y1 - 2010/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84869124027&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869124027&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84869124027
SN - 9788001045978
T3 - Proceedings of the Prague Stringology Conference 2010
SP - 178
EP - 181
BT - Proceedings of the Prague Stringology Conference 2010
T2 - Prague Stringology Conference 2010, PSC 2010
Y2 - 30 August 2010 through 1 September 2010
ER -