{"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":1771024291114,"version":"3.50.1"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p> Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M-equivalence is proposed as a canonical alternative to M-equivalence to get rid of this undesirable property. Some characterization of strong M-equivalence for a restricted class of ternary words is obtained. Finally, the existential counterpart of strong M-equivalence is introduced as well. <\/jats:p>","DOI":"10.1142\/s0129054116500155","type":"journal-article","created":{"date-parts":[[2016,10,3]],"date-time":"2016-10-03T03:13:44Z","timestamp":1475464424000},"page":"545-556","source":"Crossref","is-referenced-by-count":9,"title":["Parikh Matrices and Strong <i>M<\/i>-Equivalence"],"prefix":"10.1142","volume":"27","author":[{"given":"Wen Chean","family":"Teh","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Universiti Sains Malaysia, 11800 USM, Malaysia"}]}],"member":"219","published-online":{"date-parts":[[2016,10,2]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004735"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.022"},{"issue":"4","key":"p_4","first-page":"289","volume":"49","author":"Atanasiu A.","year":"2002","journal-title":"Fund. Inform."},{"key":"p_5","first-page":"65","volume":"73","author":"Ding C.","year":"2006","journal-title":"Fund. Inform."},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.04.001"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.024"},{"key":"p_12","first-page":"391","volume":"64","author":"Salomaa A.","year":"2005","journal-title":"Fund. Inform."},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.025"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.023"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.036"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006498"},{"key":"p_17","first-page":"265","volume":"73","author":"\u015eerbnu V. N.","year":"2006","journal-title":"Fund. Inform."},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1142\/s0129054115500069"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.03.037"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054116500155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:06:30Z","timestamp":1565197590000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054116500155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":17,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2016,10,2]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1142\/S0129054116500155"],"URL":"https:\/\/doi.org\/10.1142\/s0129054116500155","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}