On the piecewise complexity of words and periodic words

M. Praveen, Philippe Schnoebelen, Isa Vialard +1

The piecewise complexity $h(u)$ of a word is the minimal length of subwords needed to exactly characterise $u$. Its piecewise minimality index $\rho (u)$ is the smallest length $k$ suc…