Name
Abstract | ||
|---|---|---|
In this paper we define Sturmian graphs and we prove that all of them have a “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of CDAWGs of central Sturmian words. We show also that, analogously to the case of Sturmian words, these graphs converge to infinite ones. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30550-7_15 | Developments in Language Theory |
Keywords | Field | DocType |
central sturmian word,real number,continued fraction expansion,sturmian graph,deep connection,underlying graph,sturmian word | Graph,Discrete mathematics,Continued fraction,Combinatorics,Philosophy of language,Real number,Conjecture,Mathematics | Conference |
Volume | ISSN | ISBN |
3340 | 0302-9743 | 3-540-24014-4 |
Citations | PageRank | References |
2 | 0.48 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chiara Epifanio | 1 | 36 | 4.33 |
| Filippo Mignosi | 2 | 569 | 99.71 |
| Jeffrey Shallit | 3 | 163 | 20.43 |
| Ilaria Venturini | 4 | 19 | 2.41 |