On M-ambiguity of Words corresponding to a Parikh Matrix

Amrita Bhattacharjee
2017 International Journal of Computer Applications  
M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is introduced to find the M-ambiguous ternary words corresponding to a 4x4 matrix. The concept of M-ambiguity Reduction factor is introduced. With the help of this M-ambiguity Reduction factor the problem of Mambiguity can be solved to some extent.
doi:10.5120/ijca2017915439 fatcat:2ubxlir37zeitnod6jfhn4d3sm