There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q405074
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2009.02.010 / rank
Normal rank
 
Property / author
 
Property / author: James D. Currie / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012996826 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0812.4470 / 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: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of overlap-free morphisms / 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: Sharp characterizations of squarefree morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-repetition freeness of length uniform morphisms over a binary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some non finitely generated monoids of repetition-free endomorphisms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of test-sets for overlap-free morphisms / 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: Some results on \(k\)-power-free morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlap-free morphisms and finite test-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the set of cube-free $ Z$-words in a two-letter alphabet / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2009.02.010 / rank
 
Normal rank

Latest revision as of 10:25, 10 December 2024

scientific article
Language Label Description Also known as
English
There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\)
scientific article

    Statements

    There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (English)
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    cubefree word
    0 references
    cubefree morphism
    0 references
    \(n\)-power-free morphism
    0 references
    uniform morphism
    0 references

    Identifiers