Abstract
Study on numerical properties of words based on scattered subwords of words was initiated around the year 2000, introducing certain upper triangular matrices, called Parikh matrices. On the other hand, linking the areas of combinatorics on words and graph theory, a class of graphs, called Parikh word representable graphs (PWRG) of words, was introduced based on certain scattered subwords of words. Several properties of PWRG have been investigated, especially corresponding to binary words. Here, we derive several structural properties of PWRG of images of ternary words under certain morphisms.
N. Thomas—Research Scholar, K. G. Subramanian—Honorary Visiting Professor.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Atanasiu, A.: Parikh matrices, amiability and Istrail morphism. Int. J. Found. Comput. Sci. 21(6), 1021–1033 (2010)
Atanasiu, A.: Binary amiable words. Int. J. Found. Comput. Sci. 18(02), 387–400 (2007)
Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci. 390(1), 102–109 (2008)
Bera, S., Mahalingam, K.: Structural properties of word representable graphs. Math. Comput. Sci. 10(2), 209–222 (2016)
Bondy, G.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1982)
Istrail, S.: On irreducible languages and nonrational numbers. Bulletin mathématique de la Société des sciences mathématiques de Roumanie 21, 301–308 (1977)
Kitaev, S., Lozin, V.: Words and Graphs, vol. 17. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25859-1
Kitaev, S., Salimov, P., Severs, C., Ulfarsson, H.: Word-representability of line graphs. Open J. Discrete Math. 1(2), 96–101 (2011)
Mateescu, A., Salomaa, A.: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci. 15(02), 277–292 (2004)
Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping. RAIRO - Theor. Inf. Appl. 35(6), 551–564 (2001)
Mathew, L., Thomas, N., Somnath, B., Subramanian, K.G.: Some results on Parikh word representable graphs and partitions. Adv. Appl. Math. 107, 102–115 (2019)
Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison Wesley, Boston (1983)
Parikh, R.J.: On context-free languages. J. ACM 13(4), 570–581 (1966)
Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5
Salomaa, A.: Parikh matrices: subword indicators and degrees of ambiguity. In: Böckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 100–112. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98355-4_7
Teh, W.C., Ng, Z.C., Javaid, M., Chern, Z.J.: Parikh word representability of bipartite permutation graphs. Discrete Appl. Math. 282, 208–221 (2020)
Teh, W.C.: On core words and the Parikh matrix mapping. Int. J. Found. Comput. Sci. 26(01), 123–142 (2015)
Teh, W.C., Kwa, K.H.: Core words and Parikh matrices. Theor. Comput. Sci. 582, 60–69 (2015)
Acknowledgement
The authors are grateful to the reviewers for their very useful and detailed comments which helped to revise and improve the contents and presentation of the paper, correcting the errors.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Thomas, N., Mathew, L., Bera, S., Nagar, A.K., Subramanian, K.G. (2021). Parikh Word Representable Graphs and Morphisms. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-81508-0_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81507-3
Online ISBN: 978-3-030-81508-0
eBook Packages: Computer ScienceComputer Science (R0)