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 and Jan Zd'arek
dc.date.accessioned2017-01-30T10:40:04Z
dc.date.available2017-01-30T10:40:04Z
dc.date.created2011-02-16T20:01:24Z
dc.date.issued2010
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.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/4556
dc.description.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.

dc.publisherCzech Technical University
dc.titleThe Number of Runs in a Ternary Word
dc.typeConference Paper
dcterms.source.startPage178
dcterms.source.endPage181
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
dcterms.source.conferencelocationPrague
dcterms.source.placePrague
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusOpen access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record