寻找与parikh矩阵相对应的m -二义性二进制词的一些替代方法

Q4 Computer Science

International Journal of Computer Science and Applications Pub Date : 2014-02-28 DOI:10.5121/IJCSA.2014.4106

Amrita Bhattacharjee, B. S. Purkayastha

{"title":"寻找与parikh矩阵相对应的m -二义性二进制词的一些替代方法","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":"{\"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}","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

摘要

一个词的帕里克矩阵给出了这个词的子词的数值信息。本文介绍了一种求二元词的Parikh矩阵的算法。利用该算法可以求出二进制词的帕里克矩阵，无论该矩阵有多大。m -二义字是Parikh矩阵的问题。本文给出了一种快速查找二进制有序词中M个二义字的算法。我们介绍了一个在二维场中表示二进制词的系统。我们发现M -二义词在二维域的表示之间存在一定的关系。我们还介绍了一组方程，它将帮助我们计算M -歧义词。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SOME ALTERNATIVE WAYS TO FIND M -AMBIGUOUS BINARY WORDS CORRESP ONDING TO A PARIKH MATRIX

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computer Science and Applications Computer Science-Computer Science Applications

自引率

0.00%

发文量

期刊介绍： 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.