Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2007 | ELECTRONIC JOURNAL OF COMBINATORICS | combinatorics on words,number theory |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Aperiodic graph,Conjecture,Periodic graph (geometry),Mathematics,Special case,Alphabet | Journal | 14 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 11 |
PageRank | References | Authors |
0.72 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geneviève Paquin | 1 | 24 | 3.21 |
| Laurent Vuillon | 2 | 186 | 26.63 |