A generalization of Thue freeness for partial words (Q1006051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMIC COMBINATORICS ON PARTIAL WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dejean's conjecture over large alphabets / 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: How many squares must a binary sequence contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Freeness of partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding large squares in infinite binary words / rank
 
Normal rank

Revision as of 04:26, 29 June 2024

scientific article
Language Label Description Also known as
English
A generalization of Thue freeness for partial words
scientific article

    Statements

    A generalization of Thue freeness for partial words (English)
    0 references
    0 references
    0 references
    17 March 2009
    0 references
    combinatorics on words
    0 references
    partial words
    0 references
    Thue-Morse word
    0 references
    freeness
    0 references
    square-freeness
    0 references
    overlap-freeness
    0 references

    Identifiers