Bibliographic Details
| Title: |
Properties of Parikh Determinant Under Some Word Operations. |
| Authors: |
Thirumagal, S.1 (AUTHOR) thirumagal.s2020@vitstudent.ac.in, Bera, Somnath1 (AUTHOR) somnathbera89@gmail.com |
| Source: |
International Journal of Foundations of Computer Science. Jun2026, p1-17. 17p. |
| Subject Terms: |
*Text processing (Computer science), Matrices (Mathematics) |
| Abstract: |
The notion of the Parikh matrix was introduced by Mateescu (2001) to study the numerical properties of a word over an alphabet in terms of subwords. The Parikh determinant for a word has recently been introduced to study the analogy of the classical notion of determinant in matrix theory. The Parikh determinant of a word w over an alphabet Σ = {a1 < a2 < ⋯ < ak} can be computed by simply finding the number of occurrences of the scattered subword akak−1…a1, i.e., |w|akak−1…a1. This paper investigates certain Parikh determinant properties in relation to word operations such as partial sum, product, circular variance of words and SShuffle operators etc. A necessary and sufficient condition, for the Parikh determinants of two conjugate ternary words to be equal is also provided. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Index |