The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Growth problems for avoidable words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly growing k-th power-free homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-REPETITIVE SEQUENCES ON THREE SYMBOLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Abelian square-free words on four letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Patterns in the Abelian Sense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly non-repetitive sequences and progression-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank

Latest revision as of 19:38, 6 June 2024

scientific article
Language Label Description Also known as
English
The number of binary words avoiding Abelian fourth powers grows exponentially
scientific article

    Statements

    The number of binary words avoiding Abelian fourth powers grows exponentially (English)
    0 references
    10 August 2004
    0 references
    Combinatorics on words
    0 references
    Abelian repetitions
    0 references
    Entropy
    0 references
    0 references

    Identifiers