You are here: TUCS > PUBLICATIONS > Publication Search > Relational Fine and Wilf Words
Relational Fine and Wilf Words
Vesa Halava, Tero Harju, Tomi Kärki, Luca Q. Zamboni, Relational Fine and Wilf Words. In: N. Bedaride J. Cassaigne P. Arnoux (Ed.), WORDS 2007, Proceedings of the 6th International Conference on Words, 159-167, 2007.
Abstract:
We consider interaction properties of relational periods, where the
relation is a compatibility relation on words induced by a relation
on letters. By the famous theorem of Fine and Wilf, p+q-gcd(p,q)-1 is the maximal length of a word having periods p and q but not period gcd(p,q). Such words of maximal length are called extremal Fine and Wilf words. In this paper we study properties of the corresponding words in a relational variation of the Fine and Wilf theorem.
BibTeX entry:
@INPROCEEDINGS{inpHaHaKa07a,
title = {Relational Fine and Wilf Words},
booktitle = {WORDS 2007, Proceedings of the 6th International Conference on Words},
author = {Halava, Vesa and Harju, Tero and Kärki, Tomi and Zamboni, Luca Q.},
editor = {P. Arnoux, N. Bedaride J. Cassaigne},
pages = {159-167},
year = {2007},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics