Sturmian Graphs and a conjecture of Moser

Filippo Mignosi, Chiara Epifanio, Ilaria Venturini, Jeffrey Shallit

Risultato della ricerca: Otherpeer review

4 Citazioni (Scopus)

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.
Lingua originaleEnglish
Pagine175-187
Numero di pagine13
Stato di pubblicazionePublished - 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Entra nei temi di ricerca di 'Sturmian Graphs and a conjecture of Moser'. Insieme formano una fingerprint unica.

Cita questo