The equality problem for infinite words generated by primitive morphisms
arXiv:0904.2257
Abstract
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
Preliminary version of a paper to appear in Information and Computation