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. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Epifanio, C., Mignosi, F., Shallit, J., & Venturini, I. (2004). Sturmian graphs and a conjecture of moser. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 175–187. https://doi.org/10.1007/978-3-540-30550-7_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
