2 problems

Let $T$ be the alphabet, and let an $n$-uniform squarefree morphism be a morphism $h:T^*\to T^*$ for which every image $h(a)$ has length $n$ and which maps squarefree words to squa…

Let $A$ be an alphabet on $l>1$ letters, and let ${\bf s}=(i_r,\ldots,i_2,i_1)\in\mathbb{N}_{>0}^r$ be a strictly increasing sequence. The sequential method appends letters while a…