Arrangement Of Letters In Words Using Parikh Matrices
The Parikh matrix mapping is an ingenious generalization of the classical Parikh mapping in the aim to arithmetize words by numbers. Two words are M-equivalent if and only if they share the same Parikh matrix. The characterization of M-equivalent words remains open even for the case of the ternary...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | http://eprints.usm.my/61141/1/Arrangement%20of%20letters%20in%20words%20cut.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The Parikh matrix mapping is an ingenious generalization of the classical Parikh mapping in the aim to arithmetize words by numbers. Two words are M-equivalent if
and only if they share the same Parikh matrix. The characterization of M-equivalent
words remains open even for the case of the ternary alphabet. Due to the dependency
of Parikh matrices on the ordering of the alphabet, the notion of strong M-equivalence was proposed as an order-independent alternative to M-equivalence. In this work, we introduce a new symmetric transformation that justifies strong M-equivalence for the
ternary alphabet. We then extend certain work of §erbanuja to the context of strong equivalence and show that the number of strongly M-unambiguous prints for any
alphabet is always finite. |
|---|