The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
type: Item
instance of: scholarly article
title: The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
zbMATH Open document ID: 1023.68071
DOI: 10.1016/S0195-6698(03)00044-1
author: Robert O. Shelton
author: James D. Currie
published in: European Journal of Combinatorics
publication date: 2003-07-30T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1957118
zbMATH Keywords: \(\omega\)-words
MaRDI profile type: Publication
cites work: Growth problems for avoidable words
cites work: Open Problems in Pattern Avoidance
cites work: On the structure and extendibility of \(k\)-power free words
cites work: Q3125182
cites work: Sur un théorème de Thue
cites work: Binary Sequences which Contain no BBb
cites work: A periodicity theorem on words and applications
cites work: Q5186754
description: scientific article; zbMATH DE number 1957118