The number of runs in a ternary word

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2010
ページ178-181
ページ数4
出版物ステータス出版済み - 12 1 2010
イベントPrague Stringology Conference 2010, PSC 2010 - Prague, チェコ共和国
継続期間: 8 30 20109 1 2010

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2010

その他

その他Prague Stringology Conference 2010, PSC 2010
チェコ共和国
Prague
期間8/30/109/1/10

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

フィンガープリント The number of runs in a ternary word' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Bannai, H., Giraud, M., Kusano, K., Matsubara, W., Shinohara, A., & Simpson, J. (2010). The number of runs in a ternary word. : Proceedings of the Prague Stringology Conference 2010 (pp. 178-181). (Proceedings of the Prague Stringology Conference 2010).