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...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/61141/ http://eprints.usm.my/61141/1/Arrangement%20of%20letters%20in%20words%20cut.pdf |
| _version_ | 1848884630107717632 |
|---|---|
| author | Poovanandran, Ghajendran |
| author_facet | Poovanandran, Ghajendran |
| author_sort | Poovanandran, Ghajendran |
| building | USM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T19:09:45Z |
| format | Thesis |
| id | usm-61141 |
| institution | Universiti Sains Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T19:09:45Z |
| publishDate | 2019 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | usm-611412024-09-18T02:39:37Z http://eprints.usm.my/61141/ Arrangement Of Letters In Words Using Parikh Matrices Poovanandran, Ghajendran QA184-205 Linear and Multilinear Algebra, 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 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. 2019-04 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/61141/1/Arrangement%20of%20letters%20in%20words%20cut.pdf Poovanandran, Ghajendran (2019) Arrangement Of Letters In Words Using Parikh Matrices. PhD thesis, Universiti Sains Malaysia. |
| spellingShingle | QA184-205 Linear and Multilinear Algebra, Matrices Poovanandran, Ghajendran Arrangement Of Letters In Words Using Parikh Matrices |
| title | Arrangement Of Letters In Words
Using Parikh Matrices |
| title_full | Arrangement Of Letters In Words
Using Parikh Matrices |
| title_fullStr | Arrangement Of Letters In Words
Using Parikh Matrices |
| title_full_unstemmed | Arrangement Of Letters In Words
Using Parikh Matrices |
| title_short | Arrangement Of Letters In Words
Using Parikh Matrices |
| title_sort | arrangement of letters in words
using parikh matrices |
| topic | QA184-205 Linear and Multilinear Algebra, Matrices |
| url | http://eprints.usm.my/61141/ http://eprints.usm.my/61141/1/Arrangement%20of%20letters%20in%20words%20cut.pdf |