Parikh matrices and amiable words

详细信息	查看全文 | 推荐本文 |

• 作者：Adrian Atanasiu ; Radu Atanasiu ; Ion Petre
• 关键词：Parikh matrix mapping ; Amiable words ; Scattered subwords ; Rank distance
• 刊名：Theoretical Computer Science
• 出版年：2008
• 期刊代码：114_03043975
• 类别：cp
• 出版时间：22 January 2008
• 卷：390
• 期：1
• 页码：102-109
• 文件大小：234 K

摘要

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).