{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:10:37Z","timestamp":1758265837126},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> Restricting the Parikh Matrix mapping to a language rather than to an alphabet rises a set of problems that seem interesting to us. Moreover, amiability (or M -equivalence as it is named by other authors) is exploited in order to characterise certain types of languages. The paper also proposes a series of results establishing relations between classes of languages defined by Parikh matrix mappings and the Chomsky hierarchy. Finally, a result related to word composition concludes the paper, showing that for every two arbitrary words there exist two other words such that their composition (two by two) is amiable. <\/jats:p>","DOI":"10.1142\/s0129054110007684","type":"journal-article","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T08:39:03Z","timestamp":1290587943000},"page":"993-1004","source":"Crossref","is-referenced-by-count":7,"title":["PARIKH MATRIX MAPPING AND LANGUAGES"],"prefix":"10.1142","volume":"21","author":[{"given":"RADU-FLORIAN","family":"ATANASIU","sequence":"first","affiliation":[{"name":"Faculty of Computer Science, Al.I.Cuza University, Str. General Berthelot 16, Iasi 700483, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.022"},{"key":"rf2","first-page":"387","volume":"18","author":"Atanasiu A.","journal-title":"IJFCS"},{"key":"rf3","first-page":"166","volume":"49","author":"Atanasiu A.","journal-title":"Fundamenta Informaticae"},{"key":"rf4","first-page":"783","volume":"7","author":"Atanasiu A.","journal-title":"JUCS"},{"key":"rf5","first-page":"6579","volume":"73","author":"Ding C.","journal-title":"Fundamenta Informaticae"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002418"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.023"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.024"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.025"},{"key":"rf14","first-page":"265","volume":"73","author":"\u015eerb\u0103nu\u0163\u0103 V. G.","journal-title":"Fundamenta Informaticae"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054110007684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:24:16Z","timestamp":1565191456000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054110007684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":14,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S0129054110007684"],"URL":"https:\/\/doi.org\/10.1142\/s0129054110007684","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}