Parikh Matrices and Strong M-Equivalence
classification
🧮 math.CO
keywords
m-equivalencestrongmatricesparikhwordsalphabetalternativearithmetizing
read the original abstract
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. Finally, the existential counterpart of strong M-equivalence is introduced as well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.