Growth of repetition-free words -- a review (Q2484440): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038914003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There exist binary circular \(5/2^+\) power free words of every length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entropy of square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430300 / 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 ABELIAN POWER-FREE MORPHISMS / 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 the number of Abelian square-free words on four letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free words on partially commutative free monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially abelian squarefree words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of binary cube-free words of length up to 47 and their numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776771 / 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: Abelian squares are avoidable on 4 letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to decide whether a binary word contains an overlap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of irreducible binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / 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: The Goulden—Jackson cluster method: extensions, applications and implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motif statistics. / 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: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to word occurrence probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3689370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the entropy and letter frequencies of ternary square-free words / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synchronizing properties of certain prefix codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences generated by infinitely iterated morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434201 / rank
 
Normal rank

Revision as of 12:44, 10 June 2024

scientific article
Language Label Description Also known as
English
Growth of repetition-free words -- a review
scientific article

    Statements

    Growth of repetition-free words -- a review (English)
    0 references
    0 references
    1 August 2005
    0 references
    Repetitions in words
    0 references
    Square-free words
    0 references
    Overlap-free words
    0 references
    Combinatorics on words
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers