Abstract
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word w, does there exist a finite coloring of its factors such that no factorization of w is monochromatic? We show that such a coloring always exists whenever w is a Sturmian word or a standard episturmian word.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berstel, J.: Sturmian and Episturmian words (A survey of some recent results). In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 23–47. Springer, Heidelberg (2007)
Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2010)
Brown, T.C.: Colorings of the factors of a word, preprint Department of Mathematics, Simon Fraser University, Canada (2006)
Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255, 539–553 (2001)
Glen, A., Justin, J.: Episturmian words: a survey. RAIRO-Theoret. Inform. Appl. 43, 403–442 (2009)
Graham, R., Rothshild, B.L., Spencer, J.H.: Ramsey Theory, 2nd edn. J. Wiley, New York (1990)
Justin, J., Pirillo, G.: Episturmian words and episturmian morphisms. Theoret. Comput. Sci. 276, 281–313 (2002)
Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983); (reprinted by Cambridge University Press, Cambridge, 1997)
Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Richomme, G.: A Local Balance Property of Episturmian Words. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 371–381. Springer, Heidelberg (2007)
Schützenberger, M.P.: Quelques problèmes combinatoires de la théorie des automates, Cours professé à l’Institut de Programmation en 1966/67, notes by J.-F. Perrot
Zamboni, L.Q.: A Note on Coloring Factors of Words, in Oberwolfach Report 37/2010, Mini-workshop: Combinatorics on Words, pp. 42–44, August 22-27 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Luca, A., Pribavkina, E.V., Zamboni, L.Q. (2013). A Coloring Problem for Sturmian and Episturmian Words. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)