On prefixal factorizations of words
From MaRDI portal
Publication:896064
Abstract: We consider the class of all infinite words over a finite alphabet admitting a prefixal factorization, i.e., a factorization where each is a non-empty prefix of With each one naturally associates a "derived" infinite word which may or may not admit a prefixal factorization. We are interested in the class of all words of such that for all . Our primary motivation for studying the class stems from its connection to a coloring problem on infinite words independently posed by T. Brown in cite{BTC} and by the second author in cite{LQZ}. More precisely, let be the class of all words such that for every finite coloring there exist and a factorization with for each In cite{DPZ} we conjectured that a word if and only if is purely periodic. In this paper we show that so in other words, potential candidates to a counter-example to our conjecture are amongst the non-periodic elements of We establish several results on the class . In particular, we show that a Sturmian word belongs to if and only if is nonsingular, i.e., no proper suffix of is a standard Sturmian word.
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 3198886 (Why is no real title available?)
- A characterization of substitutive sequences using return words
- A coloring problem for infinite words
- Automatic Sequences
- Central sets generated by uniformly recurrent words
- Episturmian words and some constructions of de Luca and Rauzy
- MINIMAL DUVAL EXTENSIONS
- On some variations of coloring problems of infinite words
- Periodicity and unbordered segments of words
- Sturmian words, Lyndon words and trees
Cited in
(9)- A note on prefix primitive words
- Multiple factorizations of words and defect effect
- Coloring problems for infinite words
- A note of prefix n-primitive words
- Factorizing words over an ordered alphabet
- Monochromatic factorizations of words and periodicity
- On Christoffel and standard words and their derivatives
- Coloring factors of substitutive infinite words
- On prefix normal words and prefix normal forms
This page was built for publication: On prefixal factorizations of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896064)