Parikh matrices and amiable words |
| |
Authors: | Adrian Atanasiu Radu Atanasiu Ion Petre |
| |
Affiliation: | 1. Faculty of Mathematics and Computer Science, Bucharest University, Str. Academiei 14, Bucharest 010014, Romania;2. MSC, Bucharest University, Romania;3. Academy of Finland, Finland;4. Department of IT, Åbo Akademi University, Turku 20520, Finland |
| |
Abstract: | Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are called “amiable”. The presented results extend the results obtained in A. Atanasiu, Binary amiable words, Int. J. Found. Comput. Sci. 18 (2) (2007) 387–400] for the binary case. In particular it is shown that all the words having the same Parikh matrix can be obtained one from another by applying only two types of transformations. Moreover, the mirrors of two amiable words are also amiable (thus forming a symmetrical class of words). |
| |
Keywords: | Parikh matrix mapping Amiable words Scattered subwords Rank distance |
本文献已被 ScienceDirect 等数据库收录! |
|