A new geometric approach to Sturmian words (Q428857): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Q3259107 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Return words in Sturmian and episturmian words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3220482 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some combinatorial properties of Sturmian words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of factors of Sturmian words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of Sturmian words by return words / rank | |||
Normal rank |
Latest revision as of 10:00, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new geometric approach to Sturmian words |
scientific article |
Statements
A new geometric approach to Sturmian words (English)
0 references
25 June 2012
0 references
Sturmian words are one-way infinite sequences of symbols containing exactly \(n+1\) distinct factors of length \(n\geq 0\). Finite factors of Sturmian words are called finite Sturmian words. The paper describes a partition of the set of all finite Sturmian words of length \(n\) for which each part can be characterized by a specific straight line in an \(n\times n\) grid. Using this approach, the authors give new proofs of already known formulas enumerating finite Sturmian words and palindromic Sturmian words as well as a new proof of the fact that each factor of a Sturmian word \(\omega\) has exactly two return words in \(\omega\). A return word of a factor \(u\) in an infinite word \(\omega\) is a word \(v\) such that \(vu\) is a factor of \(\omega\) containing exactly two occurrences of \(u\): its prefix and its suffix.
0 references
Sturmian word
0 references
return word
0 references
enumeration
0 references