Fine and Wilf words for any periods II

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given positive integers n, and p1, ..., pr, we establish a fast word combinatorial algorithm for constructing a word w = w1 ⋯ wn of length n, with periods p1, ..., pr, and on the maximal number of distinct letters. Moreover, we show that the constructed word, which is unique up to word isomorphism, is a pseudo-palindrome - i.e. it is a fixed point of an involutory antimorphism. © 2009 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Tijdeman, R., & Zamboni, L. Q. (2009). Fine and Wilf words for any periods II. Theoretical Computer Science, 410(30–32), 3027–3034. https://doi.org/10.1016/j.tcs.2009.02.004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free