Maximal pattern complexity of words over \(\ell\) letters (Q2581466): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2711280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence entropy and the maximal pattern complexity of infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal pattern complexity for discrete systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Sturmian sequences: Combinatorial structure and transcendence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with subword complexity \(2n\) / rank
 
Normal rank

Latest revision as of 14:54, 11 June 2024

scientific article
Language Label Description Also known as
English
Maximal pattern complexity of words over \(\ell\) letters
scientific article

    Statements

    Maximal pattern complexity of words over \(\ell\) letters (English)
    0 references
    0 references
    0 references
    10 January 2006
    0 references
    0 references
    maximal pattern complexity function
    0 references
    ascending chain of alphabets
    0 references
    pattern Sturmian word
    0 references
    0 references