Online solution to time-varying matrix inverse is further investigated by proposing a new
design formula, which can accelerate Zhang neural network (ZNN) to finite-time …

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 …

Since the introduction of the Parikh matrix mapping, its injectivity problem is on top of the list
of open problems in this topic. In 2010 Salomaa provided a solution for the ternary alphabet …

Abstract The quantity| w| _ u| w| u, the number of occurrences of a word u as a (scattered)
subword of a word w gives important numerical information about the word w. Properly …

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 …

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 …

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 problem of solving complex-valued time-dependent matrix inversion (CVTD-MI) has
significant implications for statistics and control theory, and thus it is worthy to be …

The classical inference problem on words studies whether a word can be uniquely inferred
from some given binomial coefficients. The entries of the Parikh matrix are certain canonical …