A characterization of balanced episturmian sequences (Q2372877): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0611576 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:10, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterization of balanced episturmian sequences |
scientific article |
Statements
A characterization of balanced episturmian sequences (English)
0 references
16 July 2007
0 references
Summary: It is well-known that Sturmian sequences are the non ultimately periodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly \((n+1)\) distinct factors of length \(n\). A natural generalization of Sturmian sequences is the set of infinite episturmian sequences. These sequences are not necessarily balanced over a \(k\)-letter alphabet, nor are they necessarily aperiodic. In this paper, we characterize balanced episturmian sequences, periodic or not, and prove Fraenkel's conjecture for the special case of episturmian sequences. It appears that balanced episturmian sequences are all ultimately periodic and they can be classified in 3 families.
0 references
Sturmian sequences
0 references