The set of k-power free words over Σ is empty or perfect

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 Σ.