The notion of strong M-equivalence was introduced as an order-independent alternative to
M-equivalence for Parikh matrices. This paper further studies the notions of M-equivalence …

In the combinatorial study of words, the Parikh matrix mapping was introduced by Mateescu
et al. in 2001 as a natural expansion of the classical Parikh mapping. Solving the general …

Parikh matrices have been extensively investigated due to their usefulness in studying
subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of …

We introduce an extension of the restricted shuffle operator on binary words considered by
Atanasiu and Teh (2016). We then derive properties on Parikh matrix equivalence of words …

Certain upper triangular matrices, termed as Parikh matrices, are often used in the
combinatorial study of words. Given a word, the Parikh matrix of that word elegantly …

The Parikh matrix mapping is a concept that provides information on the number of
occurrences of certain (scattered) subwords in a word. Although Parikh matrices have been …

The Parikh matrix mapping allows us to describe words using matrices. Whilst compact, this
description comes with a level of ambiguity since a single matrix may describe multiple …

A word is a finite sequence of symbols. Parikh matrix of a word is an upper triangular matrix
with ones in the main diagonal and nonnegative integers above the main diagonal which …

The introduction of Parikh matrices by Mateescu et al. in 2001 has sparked numerous new
investigations in the theory of formal languages by various researchers, among whom is …

The introduction of Parikh matrices by Mateescu et al. in 2001 has sparked new
investigations in the theory of formal languages by various researchers, among whom is …