A coloring problem for infinite words
Under an Elsevier user license
open archive
Keywords
Ramsey theory
Sturmian words
Factor complexity
Cited by (0)
- 1
Partially supported by GNSAGA of CNR.
- 2
Supported under the Agreement 02.A03.21.0006 of 27.08.2013 between the Ministry of Education and Science of the Russian Federation and Ural Federal University; supported by the Presidential Program for Young Researchers, grant MK-3160.2014.1 and by the Russian Foundation for Basic Research, grant 13-01-00852.
Copyright © 2014 Elsevier Inc. All rights reserved.