On cube-free \(\omega\)-words generated by binary morphisms (Q1835915): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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: Q3860007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mots sans carre et morphismes iterés / 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: Sur un théorème de Thue / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the subword complexity of square-free DOL languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948608 / rank
 
Normal rank

Latest revision as of 18:00, 13 June 2024

scientific article
Language Label Description Also known as
English
On cube-free \(\omega\)-words generated by binary morphisms
scientific article

    Statements

    On cube-free \(\omega\)-words generated by binary morphisms (English)
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    biprefixes
    0 references
    subword
    0 references
    counterexample
    0 references
    Fibonacci-morphism
    0 references
    decidable
    0 references
    0 references