Fine and Wilf words for any periods II

  • Tijdeman R
  • Zamboni L
  • 3


    Mendeley users who have this article in their library.
  • 11


    Citations of this article.


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.

Author-supplied keywords

  • Fine and Wilf theorem
  • Palindromes
  • Pseudo-palindromes
  • Sturmian words

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • R. Tijdeman

  • L. Q. Zamboni

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free