Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 1117.68454
Epifanio, Chiara; Mignosi, Filippo; Shallit, Jeffrey; Venturini, Ilaria
Sturmian graphs and a conjecture of Moser. (English)
[A] Calude, Cristian S. (ed.) et al., Developments in language theory. 8th international conference, DLT 2004, Auckland, New Zealand, December 13--17, 2004. Proceedings. Berlin: Springer. Lecture Notes in Computer Science 3340, 175-187 (2004). ISBN 3-540-24014-4/pbk

Summary: 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.

MSC 2000:: *68R10 Graph theory in connection with computer science
68R15 Combinatorics on words
05C75 Structural characterization of types of graphs

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]