International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 173 - Issue 9 |
Published: Sep 2017 |
Authors: Amrita Bhattacharjee |
![]() |
Amrita Bhattacharjee . On M-ambiguity of Words corresponding to a Parikh Matrix. International Journal of Computer Applications. 173, 9 (Sep 2017), 44-48. DOI=10.5120/ijca2017915439
@article{ 10.5120/ijca2017915439, author = { Amrita Bhattacharjee }, title = { On M-ambiguity of Words corresponding to a Parikh Matrix }, journal = { International Journal of Computer Applications }, year = { 2017 }, volume = { 173 }, number = { 9 }, pages = { 44-48 }, doi = { 10.5120/ijca2017915439 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A Amrita Bhattacharjee %T On M-ambiguity of Words corresponding to a Parikh Matrix%T %J International Journal of Computer Applications %V 173 %N 9 %P 44-48 %R 10.5120/ijca2017915439 %I Foundation of Computer Science (FCS), NY, USA
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 M-ambiguity can be solved to some extent.