{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:31:33Z","timestamp":1758274293688},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","funder":[{"name":"Department of Mathematics, Madras Christian College","award":["F.6-6\/2016-17\/EMERITUS-2015-17-GEN-5933\/(SA-II)"],"award-info":[{"award-number":["F.6-6\/2016-17\/EMERITUS-2015-17-GEN-5933\/(SA-II)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s012905412040002x","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T01:55:02Z","timestamp":1580435702000},"page":"23-36","source":"Crossref","is-referenced-by-count":3,"title":["Parikh q-Matrices and q-Ambiguous Words"],"prefix":"10.1142","volume":"31","author":[{"given":"Somnath","family":"Bera","sequence":"first","affiliation":[{"name":"School of Automation, Huazhong University of Science and Technology, Wuhan 430074, Hubei, P. R. China"}]},{"given":"Rodica","family":"Ceterchi","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Bucharest, 14 Academiei St., 010014 Bucharest, Romania"}]},{"given":"Kalpana","family":"Mahalingam","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India"}]},{"given":"K. G.","family":"Subramanian","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Madras Christian College, Chennai 600059, India"}]}],"member":"219","published-online":{"date-parts":[[2020,1,29]]},"reference":[{"key":"S012905412040002XBIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004735"},{"key":"S012905412040002XBIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.022"},{"issue":"4","key":"S012905412040002XBIB003","first-page":"289","volume":"49","author":"Atanasiu A.","year":"2002","journal-title":"Fundamenta Informaticae"},{"key":"S012905412040002XBIB004","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054116500118"},{"key":"S012905412040002XBIB005","first-page":"97","volume":"66","author":"Egecioglu O.","year":"2006","journal-title":"Formal Models, Languages and Applications, Series in Machine Perception and Artificial Intelligence, World Scientific"},{"key":"S012905412040002XBIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"S012905412040002XBIB007","volume-title":"Combinatorics on Words","author":"Lothaire M.","year":"1983"},{"key":"S012905412040002XBIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002418"},{"key":"S012905412040002XBIB009","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"S012905412040002XBIB010","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"issue":"1","key":"S012905412040002XBIB011","first-page":"391","volume":"64","author":"Salomaa A.","year":"2005","journal-title":"Fundamenta Informatica"},{"key":"S012905412040002XBIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.04.012"},{"issue":"1","key":"S012905412040002XBIB013","first-page":"265","volume":"73","author":"Serbanuta V. N.","year":"2006","journal-title":"Fundamenta Informatica"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905412040002X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T01:55:49Z","timestamp":1580435749000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905412040002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":13,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1142\/S012905412040002X"],"URL":"https:\/\/doi.org\/10.1142\/s012905412040002x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}