Valence Languages Generated by Equality Sets

We consider the generalized equality set, i.e., the set of solutions of the generalized Post Correspondence Problem. Actually we study the solutions of a special instances where one of the morphisms is periodic and the begin word is a letter. We considering the languages defined by mapping the equality set by a coding, and prove that the family achieved is exactly family of regular valence languages over Z.