Abstract
The Parikh matrix mapping plays an important role in the study of words through numerical properties. The Parikh [Formula: see text]-matrix mapping, introduced by Egecioglu and Ibarra (2004) as an extension of the Parikh matrix mapping, maps words to matrices with polynomial entries in [Formula: see text] A word [Formula: see text] over an ordered alphabet [Formula: see text] is said to be [Formula: see text]-ambiguous if there exists another word [Formula: see text] over [Formula: see text] such that both the words have same Parikh [Formula: see text]-matrix. Here we derive several properties of [Formula: see text]-ambiguous words, in particular, for a binary alphabet.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
