A new geometric approach to Sturmian words (Q428857): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Anton Černý / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6049383 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Sturmian word | |||
Property / zbMATH Keywords: Sturmian word / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
return word | |||
Property / zbMATH Keywords: return word / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
enumeration | |||
Property / zbMATH Keywords: enumeration / rank | |||
Normal rank |
Revision as of 23:24, 29 June 2023
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