On the arithmetical complexity of Sturmian words (Q2373754): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q226469
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Anna E. Frid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021349402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of low arithmetical complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on morphic sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of sequences and dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the arithmetical complexity of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical complexity of symmetric D0L words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On possible growths of arithmetical complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of linear arithmetical complexity / 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: *-Sturmian words and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with subword complexity \(2n\) / rank
 
Normal rank

Latest revision as of 12:14, 26 June 2024

scientific article
Language Label Description Also known as
English
On the arithmetical complexity of Sturmian words
scientific article

    Statements

    On the arithmetical complexity of Sturmian words (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    0 references
    arithmetical complexity
    0 references
    Sturmian word
    0 references
    infinite word
    0 references
    subword complexity
    0 references
    rotation word
    0 references
    Fibonacci word
    0 references
    0 references