
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
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. Mambiguous 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 Mambiguous words in the two dimensional
field. We have also introduced a set of equations which will help us to calculate the M ambiguous words.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment