2 problems

Let $\mathcal A$ be an ordered alphabet, and let $\varphi_0$ and $\varphi_1$ be primitive morphisms with the same incidence matrix. Let ${\bf u}_0$ and ${\bf u}_1$ be one-sided fix…

Let … and … be the two Pisot substitutions. Sellami–Sirvent's conjecture. The balanced pair algorithm fails for the pair $(\varphi_0,\varphi_1)$. This is a specific example concern…