A cyclic binary morphism avoiding abelian fourth powers (Q1001897): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029064195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth problems for avoidable words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of binary words avoiding Abelian fourth powers grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance: themes and variations / 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: Q4453444 / 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: BLOCKING SETS OF TERMS / rank
 
Normal rank

Latest revision as of 02:33, 29 June 2024

scientific article
Language Label Description Also known as
English
A cyclic binary morphism avoiding abelian fourth powers
scientific article

    Statements

    A cyclic binary morphism avoiding abelian fourth powers (English)
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    0 references
    combinatorics on words
    0 references
    abelian repetitions
    0 references
    non-repetitive words
    0 references
    0 references