Abstract

In this paper, Parikh matrices over ternary alphabet are investigated. Algorithm is developed to display Parikh matrices of words over ternary alphabet. A set of equations for finding ternary words from the respective Parikh matrix is discussed. A theorem regarding the relations of the entries of the 4 × 4 Parikh matrices is proved. Some other results in this regard are also discussed. Significance of graphical representation of binary amiable words is given. Extension of this notion for ternary amiable words is introduced.

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 call

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.