The number of runs in a ternary word

Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2010
Pages178-181
Number of pages4
Publication statusPublished - 2010 Dec 1
EventPrague Stringology Conference 2010, PSC 2010 - Prague, Czech Republic
Duration: 2010 Aug 302010 Sep 1

Publication series

NameProceedings of the Prague Stringology Conference 2010

Other

OtherPrague Stringology Conference 2010, PSC 2010
CountryCzech Republic
CityPrague
Period10/8/3010/9/1

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'The number of runs in a ternary word'. Together they form a unique fingerprint.

Cite this