科研之友
微信
新浪微博
Facebook
分享链接
摘要
The characterization of M-equivalence for the Parikh matrices is a decade old open problem. This paper studies Parikh matrices and M-equivalence in relation to the s-shuffle operator for the binary alphabet. We also study the distance between images under the s-shuffle operator in a graph associated to the corresponding class of M-equivalent words.
- 出版日期2016-9
