Cyclic Complexity of Words (Q2922011): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951112613 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1402.5843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian and Episturmian Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics on Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Abelian Complexity of Morphic Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Christoffel classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations of balanced words via orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity for discrete systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of abelian equivalence and complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The abelian complexity of the paperfolding word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words and forbidden factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitutions in dynamics, arithmetics and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian complexity of minimal subshifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian complexity and abelian co-decomposition / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Cyclic Complexity of Words
scientific article

    Statements

    Cyclic Complexity of Words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2014
    0 references
    cyclic complexity
    0 references
    factor complexity
    0 references
    Sturmian words
    0 references
    minimal forbidden factor
    0 references

    Identifiers