Open Access2D Words and Generalized Parikh Matrices
Author(s) -
K. Janaki,
R. Arulprakasam,
V. R. Dare
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1850/1/012004
Subject(s) - extension (predicate logic) , word (group theory) , matrix (chemical analysis) , mathematics , computer science , artificial intelligence , algorithm , combinatorics , materials science , geometry , composite material , programming language
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 words. However, Parikh matrix fails to tell about the number of subword occurrences in 2D word. Therefore, in this paper we introduce the notion of generalized Parikh matrix of 2D words which fulfill the number of subwords occurrences in an 2D words and also we obtain the properties of the generalized Parikh matrices.