Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

PROUHET ARRAY MORPHISM AND PARIKH q-MATRIX

  • K. JANAKI (Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology) ;
  • R. ARULPRAKASAM (Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology) ;
  • V.R. DARE (Department of Mathematics, Madras Christian College)
  • Received : 2022.05.12
  • Accepted : 2022.11.03
  • Published : 2023.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

Prouhet string morphism has been a well investigated morphism in different studies on combinatorics on words. In this paper we consider Prouhet array morphism for the images of binary picture arrays in terms of Parikh q-matrices. We state the formulae to calculate q-counting scattered subwords of the images of any arrays under this array morphism and also investigate the properties such as q-weak ratio property and commutative property under this array morphism in terms of Parikh q- matrices of arrays.

Keywords

Acknowledgement

We would like to thank the unknown referees for their comments and suggestions on the manuscript in improving from an earlier version. The authors K. Janaki and R. Arulprakasam are very much thankful to the management, SRM Institute of Science and Technology for their continuous support and encouragement.

References

  1. A. Atanasiu, C. Martin-Vide and A. Mateescu, On the injectivity of the Parikh matrix mapping, Fundamenta Informaticae 49 (2002), 289-299.
  2. A. Atanasiu, Parikh matrices, amiability and Istrail morphism, International Journal of Foundations of Computer Science 21 (2010), 1021-1033. https://doi.org/10.1142/S0129054110007702
  3. A. Atanasiu, Morphisms on amiable words, In Annals of Bucharest University 59 (2010), 99-111.
  4. S. Bera, K. Mahaligam, L. Pan and K.G. Subramanian, Two-dimensional picture arrays and Parikh q-matrices, Journal of Physics: Conference Series 1132 (2018), 1-8.
  5. S. Bera, R. Ceterchi, K. Mahalingam and K.G. Subramanian, Parikh q-matrix and q-ambiguous Words, International Journal of Foundations of Computer Science 31 (2020), 23-36. https://doi.org/10.1142/S012905412040002X
  6. S. Bera and K. Mahaligam, Some algebraic aspects of Parikh q-matrices, International Journal of Foundations of Computer Science 27 (2016), 479-499. https://doi.org/10.1142/S0129054116500118
  7. S. Bera and K. Mahaligam, On commuting Parikh q-matrix, Fundamenta Informaticae 172 (2020), 327-341. https://doi.org/10.3233/FI-2020-1907
  8. V. Berth and R. Tijdeman, Balance properties of multi-dimensional words, Theoretical Computer Science 273 (2002), 197-224.
  9. A. Carpi and A. de Luca, Repetitions, Fullness and Uniformity In Two-Dimensional Words, International Journal of Foundations of Computer Science 15 (2004), 355-383. https://doi.org/10.1142/S0129054104002479
  10. O. Egecioglu and O.H. Ibarra, A matrix q-analogue of the Parikh map, In Exploring New Frontiers of Theoretical Informatics, Springer, Boston, MA, 2004, 125-138.
  11. V. Masilamani, K. Krithivasan, K. G. Subramanian, and A. M. Huey, Efficient algorithms for reconstruction of 2D-arrays from extended Parikh images, Lecture Notes in Computer Science 5359 (2008), 1137-1146.
  12. A. Mateescu, A. Salomaa, K. Salomaa and S. Yu, A sharpening of the Parikh mapping, Theoretical Informatics and Applications 35 (2001), 551-564. https://doi.org/10.1051/ita:2001131
  13. V. Nithya Vani, R. Stella Maragatham and K.G. Subramanian, Prouhet Array Morphism and Parikh Matrices of Arrays, International Journal of Pure and Applied Mathematics 120 (2018), 29-37.
  14. R.J. Parikh, On context-free languages, Journal of the ACM 13 (1966), 570-581. https://doi.org/10.1145/321356.321364
  15. G. Poovanandran and W.C. Teh, On M-equivalence and strong M-equivalence for Parikh matrices, International Journal of Foundations of Computer Science 29 (2018), 123-137. https://doi.org/10.1142/S0129054118500065
  16. P. Seebold, Lyndon factorization of the Prouhet words, Theoretical Computer Science 307 (2003), 179-197. https://doi.org/10.1016/S0304-3975(03)00100-2
  17. K.G. Subramanian, K. Mahalingam, R. Abdullah and A.K. Nagar, Two-Dimensional Digitized Picture Arrays and Parikh Matrices, International Journal of Foundations of Computer Science 24 (2013), 393-408. https://doi.org/10.1142/S012905411350010X
  18. W.C. Teh and K.H. Kwa, Core words and Parikh matrices, Theoretical Computer Science 582 (2015), 60-69. https://doi.org/10.1016/j.tcs.2015.03.037
  19. W.C. Teh, Separability of M-equivalent words by morphisms, International Journal of Foundations of Computer Science 27 (2016), 39-52. https://doi.org/10.1142/S0129054116500039