Lengths of extremal square-free ternary words. (Q4986268): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: The origins of combinatorics on 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: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circularly squarefree words and unbordered conjugates: a new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disposability in square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial versus exponential growth in repetition-free binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ternary square-free circular words / rank
 
Normal rank

Latest revision as of 15:01, 25 July 2024

scientific article; zbMATH DE number 7339682
Language Label Description Also known as
English
Lengths of extremal square-free ternary words.
scientific article; zbMATH DE number 7339682

    Statements

    Identifiers