Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Teh, Wen Chean
Institution: Universiti Sains Malaysia
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Universiti Sains Malaysia
Award: G6056104733
OpenAlex ID: W1962723854