On the Injectivity of the Parikh Matrix Mapping

Article type: Research Article

Authors: Atanasiu, Adrian | Martín-Vide, Carlos | Mateescu, Alexandru

Affiliations: Faculty of Mathematics, Bucharest University, Str. Academiei 14, sector 1, 70109 Bucharest, Romania | Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tarraco, 1, 43005 Tarragona, Spain

Abstract: 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 ``palindromic amiable'', such that two such words are palindromic amiable if and only if they have the same image by the Parikh matrix mapping. Some other related problems are discussed, too.

Keywords: Parikh matrix, palindrome, scattered subwords

Journal: Fundamenta Informaticae, vol. 49, no. 4, pp. 289-299, 2002