On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Roman M. Kolpakov / rank
Normal rank
 
Property / author
 
Property / author: Michaël Rao / rank
Normal rank
 
Property / author
 
Property / author: Roman M. Kolpakov / rank
 
Normal rank
Property / author
 
Property / author: Michaël Rao / rank
 
Normal rank
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.2011.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042822833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entropy of square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growth of repetition-free words -- a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-REPETITIVE SEQUENCES ON THREE SYMBOLS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlap-free words and finite automata / 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: Dejean's conjecture holds for \(n\geq 30\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dejean's conjecture holds for N ≥ 27 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Dejean’s conjecture / 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: On the entropy and letter frequencies of powerfree words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dejean's conjecture and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Last cases of Dejean's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Sided Bounds for the Growth Rates of Power-Free Languages / rank
 
Normal rank

Latest revision as of 18:04, 4 July 2024

scientific article
Language Label Description Also known as
English
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
scientific article

    Statements

    On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (English)
    0 references
    7 December 2011
    0 references
    combinatorics on words
    0 references
    repetitions
    0 references
    growth rates
    0 references
    0 references
    0 references

    Identifiers