Long binary patterns are abelian 2-avoidable (Q2378523): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding Patterns in the Abelian Sense / rank
 
Normal rank
Property / cites work
 
Property / cites work: On abelian 2-avoidable binary patterns / 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: Q5579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every binary pattern of length six is avoidable on the two-letter alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: BLOCKING SETS OF TERMS / rank
 
Normal rank

Latest revision as of 23:27, 28 June 2024

scientific article
Language Label Description Also known as
English
Long binary patterns are abelian 2-avoidable
scientific article

    Statements

    Long binary patterns are abelian 2-avoidable (English)
    0 references
    0 references
    0 references
    8 January 2009
    0 references
    0 references
    combinatorics on words
    0 references
    pattern avoidance
    0 references
    non-repetitive sequences
    0 references
    0 references