Show simple item record

dc.contributor.authorBannai, H.
dc.contributor.authorGriand, M.
dc.contributor.authorKusano, K.
dc.contributor.authorMatsubara, W.
dc.contributor.authorShinohara, A.
dc.contributor.authorSimpson, Jamie
dc.contributor.editorJan Holub
dc.contributor.editorJan Zd'arek
dc.identifier.citationBannai, 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.

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.

dc.publisherCzech Technical University
dc.titleThe Number of Runs in a Ternary Word
dc.typeConference Paper
dcterms.source.titleProceedings of the Prague Stringology Conference 2010
dcterms.source.seriesProceedings of the Prague Stringology Conference 2010
dcterms.source.conferencethe Prague Stringology Conference 2010
dcterms.source.conference-start-dateAug 30 2010
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusOpen access

Files in this item


This item appears in the following Collection(s)

Show simple item record