{"title":"SOME ALTERNATIVE WAYS TO FIND M -AMBIGUOUS BINARY WORDS CORRESP ONDING TO A PARIKH MATRIX","authors":"Amrita Bhattacharjee, B. S. Purkayastha","doi":"10.5121/IJCSA.2014.4106","DOIUrl":null,"url":null,"abstract":"Parikh matrix of a word gives numerical information of the word in terms of its subwords.In this Paper an algorithm for finding Parikh matrix of a binary wordis introduced. With the help of this algorithm Parikh matrix of a binary word, however large it may be can be found out. M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is shown to find the M - ambiguous words of a binary ordered word instantly. We have introduced a system to represent binary words in a two dimensional field. We see that there are some relations among the representations of M -ambiguous words in the two dimensional field. We have also introduced a set of equations which will help us to calculate the M - ambiguous words.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"41 1","pages":"53-64"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/IJCSA.2014.4106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 4
Abstract
Parikh matrix of a word gives numerical information of the word in terms of its subwords.In this Paper an algorithm for finding Parikh matrix of a binary wordis introduced. With the help of this algorithm Parikh matrix of a binary word, however large it may be can be found out. M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is shown to find the M - ambiguous words of a binary ordered word instantly. We have introduced a system to represent binary words in a two dimensional field. We see that there are some relations among the representations of M -ambiguous words in the two dimensional field. We have also introduced a set of equations which will help us to calculate the M - ambiguous words.
期刊介绍:
IJCSA is an international forum for scientists and engineers involved in computer science and its applications to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the IJCSA are selected through rigorous peer review to ensure originality, timeliness, relevance, and readability.