2015/01/29 by Wen Chean Teh, Teh, Wen Chean
Biochemistry, Genetics and Molecular Biology · Computer Science · #05A05 #68Q45 #68R15 #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1501.07354
openalex publication_date 2015/01/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.