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

Amrita Bhattacharjee, B. S. Purkayastha
{"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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
寻找与parikh矩阵相对应的m -二义性二进制词的一些替代方法
一个词的帕里克矩阵给出了这个词的子词的数值信息。本文介绍了一种求二元词的Parikh矩阵的算法。利用该算法可以求出二进制词的帕里克矩阵,无论该矩阵有多大。m -二义字是Parikh矩阵的问题。本文给出了一种快速查找二进制有序词中M个二义字的算法。我们介绍了一个在二维场中表示二进制词的系统。我们发现M -二义词在二维域的表示之间存在一定的关系。我们还介绍了一组方程,它将帮助我们计算M -歧义词。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Computer Science and Applications
International Journal of Computer Science and Applications Computer Science-Computer Science Applications
自引率
0.00%
发文量
0
期刊介绍: 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.
期刊最新文献
Prediction of Mental Health Instability using Machine Learning and Deep Learning Algorithms Prediction of Personality Traits and Suitable Job through an Intelligent Interview Agent using Machine Learning MultiScale Object Detection in Remote Sensing Images using Deep Learning People Counting and Tracking System in Real-Time Using Deep Learning Techniques Covid-19 Chest X-ray Images: Lung Segmentation and Diagnosis using Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1