3 problems

Let $\mathbf u$ be a binary generalized pseudostandard word, and let $\mathcal C_{\mathbf u}(n)$ denote its complexity, namely the number of factors of length $n$ in $\mathbf u$. T…

Classification conjecture. Let $\mathbf u$ be an aperiodic binary generalized pseudostandard word, not standard Sturmian, being a fixed point of a primitive morphism. Then

Let $mathcal A$ be an alphabet with $\#{\mathcal A}=d$, and let $G$ be the set of all involutory antimorphisms on $mathcal A^*$. Let $\mathbf u(\Delta,\Theta)$ be a $d$-ary general…