The Number of Runs in a Ternary Word
| dc.contributor.author | Bannai, H. | |
| dc.contributor.author | Griand, M. | |
| dc.contributor.author | Kusano, K. | |
| dc.contributor.author | Matsubara, W. | |
| dc.contributor.author | Shinohara, A. | |
| dc.contributor.author | Simpson, Jamie | |
| dc.contributor.editor | Jan Holub | |
| dc.contributor.editor | Jan Zd'arek | |
| dc.date.accessioned | 2017-01-30T10:40:04Z | |
| dc.date.available | 2017-01-30T10:40:04Z | |
| dc.date.created | 2011-02-16T20:01:24Z | |
| dc.date.issued | 2010 | |
| dc.identifier.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. | |
| dc.identifier.uri | http://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.publisher | Czech Technical University | |
| dc.title | The Number of Runs in a Ternary Word | |
| dc.type | Conference Paper | |
| dcterms.source.startPage | 178 | |
| dcterms.source.endPage | 181 | |
| dcterms.source.title | Proceedings of the Prague Stringology Conference 2010 | |
| dcterms.source.series | Proceedings of the Prague Stringology Conference 2010 | |
| dcterms.source.conference | the Prague Stringology Conference 2010 | |
| dcterms.source.conference-start-date | Aug 30 2010 | |
| dcterms.source.conferencelocation | Prague | |
| dcterms.source.place | Prague | |
| curtin.department | Department of Mathematics and Statistics | |
| curtin.accessStatus | Open access |