Two infinite words x and y are said to be subword equivalent if they have the same set of finite subwords (factors). The subword equivalence problem is the question whether two infinite words are subword equivalent. We show that, under mild hypotheses, the decidability of the subword equivalence problem implies the decidability of the -sequence equivalence problem, a problem which has been shown to be decidable by ulik and Harju for morphic words (i.e. words generated by iterating a morphism). Yet, we do use the decidability of the -sequence equivalence problem to prove our result. We prove that the subword equivalence problem is decidable for two morphic words, provided the morphisms are primitive and have bounded delays. We also prove that the sub-word equivalence problem is decidable for any pair of morphic words in the case of a binary alphabet. Our results hold in fact for a stronger version, namely for the subword inclusion problem.
展开▼
