Counting bordered and primitive words with a fixed weight.

Tools

Harju, Tero and Nowotka, Dirk (2005) Counting bordered and primitive words with a fixed weight. Theoretical Computer Science, 340 (2). pp. 273-279. DOI 10.1016/j.tcs.2005.03.040.

[thumbnail of CountingWeightedWords.pdf]
Preview
 Text
CountingWeightedWords.pdf
Download (146kB) | Preview

Supplementary data:

Abstract

A word w is primitive if it is not a proper power of another word, and w is unbordered if it has no prefix that is also a suffix of w. We study the number of primitive and unbordered words w with a fixed weight, that is, words for which the Parikh vector of w is a fixed vector. Moreover, we estimate the number of words that have a unique border.

Document Type: Article
Keywords: combinatorics on words borders primitive words
Research affiliation: Kiel University
Refereed: Yes
Date Deposited: 12 Feb 2013 17:07
Last Modified: 24 Sep 2019 00:15
URI: https://oceanrep.geomar.de/id/eprint/20287

Actions (login required)

View Item View Item