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 …

The introduction of the Parikh matrix mapping by Mateescu et al. in 2001 gave rise to the
injectivity problem, that is, the characterization of words having the same Parikh matrix …

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 focus of this work is the study of Parikh matrices with emphasis on two concrete
problems. In the first part of our presentation we show that a conjecture by Dick at al. in 2021 …

Based on the idea of count of certain subwords of a word, the notion of Parikh matrix of a
word over an ordered alphabet was introduced. On the other hand, with a two-dimensional …

In this paper, we extend the concept of a generalized Parikh vector of the partial word known
as e--generalized Parikh vector, and its related properties are studied. We also introduce the …

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 …

The injectivity problem of the Parikh matrix is closely related to the characterization of the M-
equivalence. Current studies provide partial results such as a necessary condition of the M …

Data transmissions are often subjected to errors due to the noise in the channel. Due to the
possibility of errors in the received word, it is important to be able to correct the received …