On the Injectivity of the Parikh Matrix Mapping

In this paper we investigate the injectivity of the Parikh matrix mapping. This research is done mainly on the binary alphabet. We identify a family of binary words, refered to as "palindromicly amicable", such that two such words are palindromicly amicable if and only if they have the same image by the Parikh matrix mapping. Some other related problems are discussed, too.

• Type: Journal
• Year: 2002
• Where: FUIN
• Authors: Adrian Atanasiu, Carlos Martín-Vide, Alexandru Mateescu
• Keywords: Binary Alphabet, Binary Words, FUIN 2002, Parikh Matrix Mapping