View Item 

The Number of Runs in a Ternary Word

Access Status
Open access
Authors
Bannai, H.
Griand, M.
Kusano, K.
Matsubara, W.
Shinohara, A.
Simpson, Jamie
Date
2010
Type
Conference Paper

Metadata
Show full item record
Citation
Bannai, Hideo and Griand, Mathieu and Kusano, Kazuhiko and Matsubara, Wataru and Shinohara, Ayumi and Simpson, Jamie. 2010. The Number of Runs in a Ternary Word, in Holub, J. and Zd'arek, J. (ed), The Prage Stringology Conference 2010, Aug 30 2010, pp. 178-181. Prague, Czech Republic: Czech Technical University.
Source Title
Proceedings of the Prague Stringology Conference 2010
Source Conference
the Prague Stringology Conference 2010
School
Department of Mathematics and Statistics
URI
Collection
Abstract

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.