The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: James D. Currie / rank
Normal rank
 
Property / author
 
Property / author: James D. Currie / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth problems for avoidable words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Pattern Avoidance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and extendibility of \(k\)-power free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un théorème de Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Sequences which Contain no BBb / rank
 
Normal rank
Property / cites work
 
Property / cites work: A periodicity theorem on words and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186754 / rank
 
Normal rank

Latest revision as of 18:49, 5 June 2024

scientific article
Language Label Description Also known as
English
The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
scientific article

    Statements

    The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (English)
    0 references
    0 references
    0 references
    30 July 2003
    0 references
    0 references
    \(\omega\)-words
    0 references