Abelian maximal pattern complexity of words (Q5175078): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Elemental methods in ergodic Ramsey theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity of words over \(\ell\) letters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform sets and super-stationary sets over general alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian complexity of minimal subshifts / rank
 
Normal rank

Revision as of 16:55, 9 July 2024

scientific article; zbMATH DE number 6406328
Language Label Description Also known as
English
Abelian maximal pattern complexity of words
scientific article; zbMATH DE number 6406328

    Statements

    Abelian maximal pattern complexity of words (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2015
    0 references
    complexity of infinite words
    0 references
    abelian equivalence
    0 references
    binary words
    0 references

    Identifiers