A New Operator over Parikh Languages
Adrian Atanasiu, Wen Chean Teh · International Journal of Foundations of Computer Science · 2016
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.