In this paper we undertake the general study of the Abelian complexity of an infinite word on
a finite alphabet. We investigate both similarities and differences between the Abelian …

Parikh matrices recently introduced give much more information about a word than just the
number of occurrences of each letter. In this paper we introduce the closely related notion of …

The binomial coefficient of two words u and v is the number of times v occurs as a
subsequence of u. Based on this classical notion, we introduce the m-binomial equivalence …

Some characterizations of Parikh matrix equivalent binary words | Information Processing Letters
skip to main content ACM Digital Library home ACM Association for Computing Machinery …

Using the fact that the Parikh matrix map** is not an injective map**, the paper
investigates some properties of the set of the binary words having the same Parikh matrix; …

The paper investigates inequalities between the numbers of different (scattered) subword
occurrences. The Parikh matrix recently introduced is an efficient tool. We give various …

Parikh matrices recently introduced have turned out to be a powerful tool in the arithmetizing
of the theory of words. In particular, many inequalities between (scattered) subword …

We deal with the notion of M-unambiguity [5] in connection with the Parikh matrix map**
introduced by Mateescu and others in [7]. M-unambiguity is studied both in terms of words …

G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism τ: 0↦ 01,
1↦ 02 and 2↦ 0 is measure-theoretically conjugate to an exchange of three fractal domains …

This paper investigates the criteria for deciding whether two words are matrix equivalent.
Certain upper diagonal matrices, generally referred to as the Parikh matrices, have been …