Title of article
The set of k-power free words over Σ is empty or perfect
Author/Authors
Currie، نويسنده , , James D. and Shelton، نويسنده , , Robert O.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
8
From page
573
To page
580
Abstract
The authors show that for a natural number k and a finite alphabet Σ the set of ω-words over Σ avoiding xk is either empty or perfect. This leads to an algorithm to determine which k-power free words over Σ extend to k-power free ω-words over Σ.
Journal title
European Journal of Combinatorics
Serial Year
2003
Journal title
European Journal of Combinatorics
Record number
1548779
Link To Document