Pseudo-solutions of word equations

Abstract: We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a pseudo-solution and a pseudo-rank of an equation. In particular, this allows to prove that if a classical equation forces periodicity then it also forces pseudo-periodicity. Consequently, there is no need to investigate generalizations of important equations one by one.