Formal languages
Journal of the ACM (JACM)
On the injectivity of the Parikh matrix mapping
Fundamenta Informaticae
Theoretical Computer Science
Subword histories and Parikh matrices
Journal of Computer and System Sciences
Some characterizations of Parikh matrix equivalent binary words
Information Processing Letters
On the Injectivity of Parikh Matrix Mappings
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Injectivity of the Parikh Matrix Mappings Revisited
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Parikh matrices and amiable words
Theoretical Computer Science
Subword histories and associated matrices
Theoretical Computer Science
Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Editorial: Combinatorial approach to image analysis
Discrete Applied Mathematics
Thinning on cell complexes from polygonal tilings
Discrete Applied Mathematics
Scattered subword complexity of non-primitive words
Journal of Automata, Languages and Combinatorics
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Hi-index | 0.00 |
Mateescu et al (2001) introduced the notion of Parikh matrix of a word as an extension of the well-known concept of Parikh vector of a word. The Parikh matrix provides more numerical information about a word than given by the Parikh vector. Here we introduce the notion of M-vector of a binary word which allows us to have a linear notation in the form of a unique vector representation of the Parikh matrix of the binary word. We then extend this notion of M-vector to a binary image treating it as a binary array over a two-symbol alphabet. This is done by considering the M-vectors of the words in the rows and columns of the array. Among the properties associated with a Parikh matrix, M-ambiguity or simply ambiguity of a word is one which has been investigated extensively in the literature. Here M-ambiguity of a binary array is defined in terms of its M-vector and we obtain conditions for M-ambiguity of a binary array.