Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102502
Title: A coloring problem for Sturmian and episturmian words
Authors: De, Luca, A.
Pribavkina, E. V.
Zamboni, L. Q.
Issue Date: 2013
Citation: De Luca A. A coloring problem for Sturmian and episturmian words / A. De Luca, E. V. Pribavkina, L. Q. Zamboni. — DOI 10.1007/978-3-642-38771-5_18 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2013. — Vol. 7907 LNCS. — P. 191-202.
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. © 2013 Springer-Verlag.
Keywords: COLORING PROBLEMS
EPISTURMIAN WORDS
INFINITE WORD
RAMSEY THEORY
STURMIAN
STURMIAN WORD
ARTIFICIAL INTELLIGENCE
COMPUTER SCIENCE
URI: http://hdl.handle.net/10995/102502
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 84884137865
PURE ID: 865626
95d3e833-ef20-467f-bdcf-49273f85108b
ISSN: 3029743
ISBN: 9783642387708
DOI: 10.1007/978-3-642-38771-5_18
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84884137865.pdf134,84 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.