Fine and Wilf words for any periods II

Authors:
R. Tijdeman;L. Q. Zamboni
Affiliations:
Leiden University, Mathematical Institute, Postbus 9512, 2300 RA Leiden, The Netherlands;Université Lyon 1, CNRS UMR 5208 Institut Camille Jordan, 43, blvd du 11 novembre 1918, F-69622 Villeurbanne Cedex, France and Reykjavik University, School of Computer Science, Kringlan 1, 10 ...
Venue:
Theoretical Computer Science
Year:
2009

Citing 4
Cited 6

Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Theoretical Computer Science
Generalised fine and Wilf's theorem for arbitrary number of periods

Theoretical Computer Science - Combinatorics on words
Pseudopalindrome closure operators in free monoids

Theoretical Computer Science
On different generalizations of episturmian words

Theoretical Computer Science

On θ-episturmian words

European Journal of Combinatorics
On graphs of central episturmian words

Theoretical Computer Science
On a special class of primitive words

Theoretical Computer Science
Fine and wilf's theorem for k-abelian periods

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Pseudoperiodic words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Lyndon words and Fibonacci numbers

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	5.23

Visualization

Abstract

Given positive integers n, and p"1,...,p"r, we establish a fast word combinatorial algorithm for constructing a word w=w"1...w"n of length n, with periods p"1,...,p"r, 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.