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.
EPIFANIO, C., MIGNOSI, F., SHALLIT, J., VENTURINI, I. (2004). Sturmian Graphs and a conjecture of Moser. In Developments in Language Theory (pp.175-187) [10.1007/978-3-540-30550-7_15].
Sturmian Graphs and a conjecture of Moser
EPIFANIO, Chiara;MIGNOSI, Filippo;
2004-01-01
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
