{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:11:31Z","timestamp":1771024291583,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T00:00:00Z","timestamp":1535587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004595","name":"Universiti Sains Malaysia","doi-asserted-by":"publisher","award":["1011\/PMATHS\/8011019"],"award-info":[{"award-number":["1011\/PMATHS\/8011019"]}],"id":[{"id":"10.13039\/501100004595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00236-018-0327-8","type":"journal-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T01:14:53Z","timestamp":1535591693000},"page":"521-535","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Parikh matrices for powers of words"],"prefix":"10.1007","volume":"56","author":[{"given":"Adrian","family":"Atanasiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghajendran","family":"Poovanandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8424-9820","authenticated-orcid":false,"given":"Wen Chean","family":"Teh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,30]]},"reference":[{"issue":"2","key":"327_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054107004735","volume":"18","author":"A Atanasiu","year":"2007","unstructured":"Atanasiu, A.: Binary amiable words. Internat. J. Found. Comput. Sci. 18(2), 387\u2013400 (2007)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1","key":"327_CR2","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2007.10.022","volume":"390","author":"A Atanasiu","year":"2008","unstructured":"Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci. 390(1), 102\u2013109 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"327_CR3","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1080\/00207160.2012.742243","volume":"90","author":"A Atanasiu","year":"2013","unstructured":"Atanasiu, A., Atanasiu, R.-F.: Enriching Parikh matrix mappings. Int. J. Comput. Math. 90(3), 511\u2013521 (2013)","journal-title":"Int. J. Comput. Math."},{"issue":"4","key":"327_CR4","first-page":"289","volume":"49","author":"A Atanasiu","year":"2002","unstructured":"Atanasiu, A., Mart\u00edn-Vide, C., Mateescu, A.: On the injectivity of the Parikh matrix mapping. Fund. Inform. 49(4), 289\u2013299 (2002)","journal-title":"Fund. Inform."},{"issue":"6","key":"327_CR5","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1142\/S0129054116500271","volume":"27","author":"A Atanasiu","year":"2016","unstructured":"Atanasiu, A., Teh, W.C.: A new operator over Parikh languages. Int. J. Found. Comput. Sci. 27(6), 757\u2013769 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"327_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1142\/S0129054116500118","volume":"27","author":"S Bera","year":"2016","unstructured":"Bera, S., Mahalingam, K.: Some algebraic aspects of Parikh q-matrices. Int. J. Found. Comput. Sci. 27(4), 479\u2013499 (2016)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"327_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1051\/ita\/2009021","volume":"44","author":"A \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, A.: Generalizations of Parikh mappings. RAIRO Theor. Inform. Appl. 44(2), 209\u2013228 (2010)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"327_CR8","first-page":"291","volume":"84","author":"A Clark","year":"2008","unstructured":"Clark, A., Watkins, C.: Some alternatives to Parikh matrices using string kernels. Fund. Inform. 84, 291\u2013303 (2008)","journal-title":"Fund. Inform."},{"key":"327_CR9","first-page":"147","volume":"2004","author":"\u00d6 Egecioglu","year":"2004","unstructured":"Egecioglu, \u00d6.: A q-matrix encoding extending the parikh matrix mapping. Proc. ICCC 2004, 147\u2013153 (2004)","journal-title":"Proc. ICCC"},{"issue":"3","key":"327_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0129054118500119","volume":"29","author":"K Mahalingam","year":"2018","unstructured":"Mahalingam, K., Bera, S., Subramanian, K.G.: Properties of Parikh matrices of words obtained by an extension of a restricted shuffle operator. Int. J. Found. Comput. Sci. 29(3), 403\u2013413 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"327_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1142\/9789812792464_0018","volume-title":"Developments in Language Theory","author":"J Manuch","year":"2000","unstructured":"Manuch, J.: Characterization of a word by its subwords. In: Rozenberg, G. (ed.) Developments in Language Theory, pp. 210\u2013219. World Scientific Publ. Co., Singapore (2000)"},{"issue":"6","key":"327_CR12","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1051\/ita:2001131","volume":"35","author":"A Mateescu","year":"2001","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping. Theor. Inform. Appl. 35(6), 551\u2013564 (2001)","journal-title":"Theor. Inform. Appl."},{"issue":"1","key":"327_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2003.04.001","volume":"68","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comput. System Sci. 68(1), 1\u201321 (2004)","journal-title":"J. Comput. System Sci."},{"key":"327_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. Assoc. Comput. Mach. 13, 570\u2013581 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"327_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/S0129054118500065","volume":"29","author":"G Poovanandran","year":"2018","unstructured":"Poovanandran, G., Teh, W.C.: On M-equivalence and strong M-equivalence for Parikh matrices. Int. J. Found. Comput. Sci. 29(1), 123\u2013137 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"327_CR16","unstructured":"Poovanandran, G., Teh, W.C.: Strong \n                    \n                      \n                    \n                    $$2\\cdot t$$\n                    \n                      \n                        \n                          2\n                          \u00b7\n                          t\n                        \n                      \n                    \n                   and strong \n                    \n                      \n                    \n                    $$3\\cdot t$$\n                    \n                      \n                        \n                          3\n                          \u00b7\n                          t\n                        \n                      \n                    \n                   transformations for strong M-equivalence. Int. J. Found. Comput. Sci. (in press)"},{"key":"327_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6","volume-title":"Handbook of Formal Languages","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 1. Springer, Berlin (1997)"},{"issue":"16","key":"327_CR18","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.tcs.2010.01.036","volume":"411","author":"A Salomaa","year":"2010","unstructured":"Salomaa, A.: Criteria for the matrix equivalence of words. Theor. Comput. Sci. 411(16), 1818\u20131827 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"327_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1142\/S0129054110007155","volume":"21","author":"A Salomaa","year":"2010","unstructured":"Salomaa, A., Yu, S.: Subword occurrences, Parikh matrices and Lyndon images. Int. J. Found. Comput. Sci. 21(1), 91\u2013111 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"327_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(03)00396-7","volume":"310","author":"T-F \u015eerb\u0103nu\u0163\u0103","year":"2004","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.-F.: Extending Parikh matrices. Theor. Comput. Sci. 310, 233\u2013246 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"327_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1142\/S0129054109006498","volume":"20","author":"VN \u015eerb\u0103nu\u0163\u0103","year":"2009","unstructured":"\u015eerb\u0103nu\u0163\u0103, V.N.: On Parikh matrices, ambiguity, and prints. Int. J. Found. Comput. Sci. 20(1), 151\u2013165 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"327_CR22","first-page":"265","volume":"73","author":"VN \u015eerb\u0103nu\u0163\u0103","year":"2006","unstructured":"\u015eerb\u0103nu\u0163\u0103, V.N., \u015eerb\u0103nu\u0163\u0103, T.F.: Injectivity of the Parikh matrix mappings revisited. Fund. Inform. 73(1), 265\u2013283 (2006)","journal-title":"Fund. Inform."},{"issue":"2","key":"327_CR23","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0129054109006528","volume":"20","author":"KG Subramanian","year":"2009","unstructured":"Subramanian, K.G., Huey, A.M., Nagar, A.K.: On Parikh matrices. Int. J. Found. Comput. Sci. 20(2), 211\u2013219 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"327_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1142\/s0129054115500069","volume":"26","author":"WC Teh","year":"2015","unstructured":"Teh, W.C.: On core words and the Parikh matrix mapping. Int. J. Found. Comput. Sci. 26(1), 123\u2013142 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"327_CR25","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3233\/FI-2016-1388","volume":"146","author":"WC Teh","year":"2016","unstructured":"Teh, W.C.: Parikh matrices and Parikh rewriting systems. Fund. Inform. 146, 305\u2013320 (2016)","journal-title":"Fund. Inform."},{"key":"327_CR26","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2016.03.008","volume":"628","author":"WC Teh","year":"2016","unstructured":"Teh, W.C., Atanasiu, A.: On a conjecture about Parikh matrices. Theor. Comput. Sci. 628, 30\u201339 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"327_CR27","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2017.11.016","volume":"719","author":"WC Teh","year":"2018","unstructured":"Teh, W.C., Atanasiu, A., Poovanandran, G.: On strongly M-unambiguous prints and \u015eerb\u0103nu\u0163\u0103\u2019s conjecture for Parikh matrices. Theor. Comput. Sci. 719, 86\u201393 (2018)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-018-0327-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-018-0327-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-018-0327-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T04:44:10Z","timestamp":1569300250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-018-0327-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,30]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s00236-018-0327-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,30]]},"assertion":[{"value":"17 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}