Extending Parikh q-matrices
نویسندگان
چکیده
1. A. Atanasiu. Binary amiable words. International Journal of Foundations of Computer Science, 18(2):387–400, 2007. 2. A. Atanasiu, R. Atanasiu, and I. Petre. Parikh matrices and amiable words. Theoretical Computer Science, 390:102–109, 2008. 3. A. Atanasiu, C. Martin-Vide, and A. Mateescu. On the injectivity of the parikh matrix mapping. Fundamenta Informatica, 46:1–11, 2001. 4. S. Bera and K. Mahalingam. Some algebraic aspects of parikh q-matrices. International
منابع مشابه
A q-Matrix Encoding Extending the Parikh Matrix Mapping
We introduce a generalization of the Parikh mapping called the Parikh q-matrix encoding, which takes its values in matrices with polynomial entries. The encoding represents a word w over a k-letter alphabet as a (k + 1)-dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable q. Putting q = 1, we obtain the morphism introduced by Mateescu, Salomaa, ...
متن کاملExtending Parikh matrices
We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of matrices. We also study the relation between these two notions. We show that combining properties from both we obtain a more powerful tool for proving algebraic properties of words.
متن کاملA Matrix q-Analogue of the Parikh Map
We introduce an extension of the Parikh mapping called the Parikh -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represents a word over a -letter alphabet as a -dimensional upper-triangular matrix with entries that are nonnegative integral polynomials in variable . We show that by appropriately embedding the -letter alphabet into the -lette...
متن کاملParikh Matrices and Words over Tertiary Ordered Alphabet
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. T...
متن کاملParikh Matrices and Strong M-Equivalence
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M -equivalence is proposed as a canonical alternative to M -equivalence to get rid of this undesirable property. Some characterization of strong M -equivalence for a restricted class of words is obtained. Finall...
متن کامل