Combinatorial properties of 1D Fibonacci words is a well studied topic in Formal language
theory. In the year 2000, Apostolico et. al. extended the concept of one dimensional …

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 …

As a natural extension of the Parikh matrix of a picture array induced by an alphabet, this
paper investigates the concept of extending the Parikh matrix of a picture array induced by a …

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 …

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 extension of Parikh vector is Parikh matrix which is a useful tool in arithmetizing words
by numbers. Another interesting problem is the extension of Parikh matrix of a words to 2D …

The word inference problem is to determine languages such that the information on the
number of occurrences of those subwords in the language can uniquely identify a word. A …

The theory of Parikh matrices and subword occurrences has led to extensive research in
combinatorics on words. The extension of Parikh matrix of a word into picture array is an …

A word is a finite sequence of symbols. Parikh matrix of a word is an upper triangular matrix
with 1 in the main diagonal and non-negative integers above the main diagonal which give …

Based on the idea of" q—count" of certain subwords of a word and generalizing the notion of
Parikh matrix of a word, the notion of Parikh q—matrix of a word over an ordered alphabet …