{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:57:20Z","timestamp":1776859040466,"version":"3.51.2"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:p> Parikh matrix mapping or Parikh matrix of a word has been introduced in the literature to count the scattered subwords in the word. Several properties of a Parikh matrix have been extensively investigated. A picture array is a two-dimensional connected digitized rectangular array consisting of a finite number of pixels with each pixel in a cell having a label from a finite alphabet. Here we extend the notion of Parikh matrix of a word to a picture array and associate with it two kinds of Parikh matrices, called row Parikh matrix and column Parikh matrix. Two picture arrays A and B are defined to be M-equivalent if their row Parikh matrices are the same and their column Parikh matrices are the same. This enables to extend the notion of M-ambiguity to a picture array. In the binary and ternary cases, conditions that ensure M-ambiguity are then obtained. <\/jats:p>","DOI":"10.1142\/s012905411350010x","type":"journal-article","created":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T08:23:34Z","timestamp":1372926214000},"page":"393-408","source":"Crossref","is-referenced-by-count":9,"title":["TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES"],"prefix":"10.1142","volume":"24","author":[{"given":"K. G.","family":"SUBRAMANIAN","sequence":"first","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KALPANA","family":"MAHALINGAM","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Chennai, 600036, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ROSNI","family":"ABDULLAH","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Universiti Sains Malaysia, 11800 Penang, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ATULYA K.","family":"NAGAR","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool L16 9JD, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,7,3]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004735"},{"key":"p_2","first-page":"1","volume":"46","author":"Atanasiu A.","year":"2001","journal-title":"Fund. Inform."},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.022"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218654308001142"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.09.010"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.06.030"},{"key":"p_7","first-page":"233","volume":"13","author":"Fazekas S.Z.","year":"2008","journal-title":"Languages and Combinatorics"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054112500049"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89646-3_113"},{"key":"p_12","first-page":"170","volume":"2004","author":"Mateescu A.","journal-title":"Berlin"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002418"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.04.001"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1957-044-3"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.023"},{"key":"p_20","first-page":"117","volume":"2009","author":"Salomaa A.","journal-title":"Univ. of Szeged"},{"key":"p_21","first-page":"391","volume":"64","author":"Salomaa A.","year":"2005","journal-title":"Fundam. Inf."},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.036"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054110007155"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00396-7"},{"key":"p_25","first-page":"265","volume":"73","author":"Serbanuta V. N.","year":"2006","journal-title":"Fundam. Inf."},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006498"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006528"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21073-0_23"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411350010X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:41:30Z","timestamp":1565134890000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411350010X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":26,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2013,7,3]]},"published-print":{"date-parts":[[2013,4]]}},"alternative-id":["10.1142\/S012905411350010X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411350010x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]}}}