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.
Author supplied keywords
Cite
CITATION STYLE
Bhattacharjee, A., & Purkayastha, B. S. (2015). Parikh matrices and words over ternary alphabet. In Advances in Intelligent Systems and Computing (Vol. 335, pp. 135–145). Springer Verlag. https://doi.org/10.1007/978-81-322-2217-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
