A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Some Alternative Ways to Find M-Ambiguous Binary Words Corresponding to a Parikh Matrix
2014
International Journal on Computational Science & Applications
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 word is 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
doi:10.5121/ijcsa.2014.4106
fatcat:zh4rr32znvgmfmyxvn4vvysxli