A1 Refereed original research article in a scientific journal
Counting bordered and primitive words with a fixed weight
Authors: Harju T, Nowotka D
Publisher: ELSEVIER SCIENCE BV
Publication year: 2005
Journal:: Theoretical Computer Science
Journal name in source: THEORETICAL COMPUTER SCIENCE
Journal acronym: THEOR COMPUT SCI
Volume: 340
Issue: 2
First page : 273
Last page: 279
Number of pages: 7
ISSN: 0304-3975
DOI: https://doi.org/10.1016/j.tcs.2005.03.040
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. (c) 2005 Elsevier B.V All rights reserved.
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. (c) 2005 Elsevier B.V All rights reserved.
UTU Research Portal