CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Parikh Matrices and Words over Tertiary Ordered Alphabet

by Amrita Bhattacharjee, Bipul Syam Purkayastha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 85 - Number 4
Year of Publication: 2014
Authors: Amrita Bhattacharjee, Bipul Syam Purkayastha
10.5120/14827-3069

Amrita Bhattacharjee, Bipul Syam Purkayastha . Parikh Matrices and Words over Tertiary Ordered Alphabet. International Journal of Computer Applications. 85, 4 ( January 2014), 10-15. DOI=10.5120/14827-3069

@article{ 10.5120/14827-3069,
author = { Amrita Bhattacharjee, Bipul Syam Purkayastha },
title = { Parikh Matrices and Words over Tertiary Ordered Alphabet },
journal = { International Journal of Computer Applications },
issue_date = { January 2014 },
volume = { 85 },
number = { 4 },
month = { January },
year = { 2014 },
issn = { 0975-8887 },
pages = { 10-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume85/number4/14827-3069/ },
doi = { 10.5120/14827-3069 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:01:35.393561+05:30
%A Amrita Bhattacharjee
%A Bipul Syam Purkayastha
%T Parikh Matrices and Words over Tertiary Ordered Alphabet
%J International Journal of Computer Applications
%@ 0975-8887
%V 85
%N 4
%P 10-15
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. This algorithm proves a good tool for further investigation of Parikh Matrices of words over tertiary alphabet. A set of equations for finding tertiary words from the respective Parikh matrix is introduced. These equations are useful to find tertiary words from the respective Parikh matrix. Examples are given. Some examples of larger tertiary words are given with their Parikh matrices as result analysis. A distance is defined on classes of M- ambiguous words over tertiary ordered alphabet. It is named as stepping distance. One can compare words by this stepping distance.

References
  1. R. J. Parikh: On the context-free languages. Journal of the Association for Computing Machinery, 13 (1966), 570-581.
  2. A. Mateescu, A. Salomaa, K. Salomaa, S. Yu: A sharpening of the Parikh Mapping. Theoret. Informetics Appl. , 35 (2001), 551-564.
  3. A. Mateescu, A. Salomaa, K. Salomaa, S. Yu: On an extension of the Parikh mapping, T. U. C. S Technical Report No 364.
  4. K. G. Subramanian, A. M. Huey, A. K. Nagar: On Parikh matrices, Int. J. Found. Comput. Sci. 20(2) (2009)211-219.
  5. C. Ding, A. Salomaa: On some problems of Mateescu concerning sub word occurrences, Fundamenta Informaticae 72(2006) 1-15.
  6. V. N. Serb?anut?a, Injectivity of the Parikh matrix mappings revisited, Fundamenta Informaticae XX (2006) 1–19, IOS Press.
  7. A. Atanasiu, C. M. Vide, A. Mateescu, On the injectivity of the Parikh matrix mapping, Fundam. Informa. 46 (2001) 1-11.
  8. A. Salomaa et al. Subword conditions and subword histories. Information and Computation 204 (2006) 1741–1755.
  9. A. Mateescu, A. Salomaa: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci, 15 (2004), 277–292.
  10. A. Mateescu, A. Salomaa, S. Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. , 68 (2004), 1–21.
  11. T. -F. S¸ erb?anut¸?a: Extending Parikh matrices. Theoretical Computer Science, 310 (2004), 233–246.
  12. S. Fosse, G. Richmomme, Some characterizations of Parikh matrix equivalent binary words, Information Processing Letters. 92 (2) (2004) 77–82.
  13. Al. Mateescu, A. Salomaa, Matrix indicators for subword occurrences and ambiguity, Int. J. Found. Comput. Sci. 15 (2004) 277–292.
  14. A. Salomaa: Connections between subwords and certain matrix mappings. Theoretical Computer Science, 340 (2005), 188–203.
  15. A. Salomaa, Independence of certain quantities indicating subword occurrences, Theoretical Computer Science. 362 (1) (2006) 222–231.
  16. A. Salomaa et al. Subword conditions and subword histories. Information and Computation 204 (2006) 1741–1755.
  17. Adrian Atanasiu, Radu Atanasiu, Ion Petre: Parikh matrices and amiable words. Theoretical Computer Science 390 (2008) 102–109.
  18. A. Atanasiu, Binary amiable words, Int. J. Found. Comput. Sci 18 (2) (2007) 387-400.
Index Terms

Computer Science
Information Sciences

Keywords

M-ambiguity Parikh mapping Parikh matrix subword word Stepping distance

Powered by PhDFocusTM