PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP (Q2841975): 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 / arXiv ID
 
Property / arXiv ID: 1102.5527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of factors in the Thue-Morse word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On periodicity and low complexity of infinite permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the infinite permutation generated by the period doubling word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation complexity of the Thue-Morse word / rank
 
Normal rank

Latest revision as of 17:18, 6 July 2024

scientific article
Language Label Description Also known as
English
PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP
scientific article

    Statements

    PERMUTATION COMPLEXITY AND THE LETTER DOUBLING MAP (English)
    0 references
    0 references
    30 July 2013
    0 references
    0 references
    infinite permutation
    0 references
    permutation complexity
    0 references
    uniformly recurrent
    0 references
    Sturmian words
    0 references
    Thue-Morse word
    0 references
    0 references