{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:13:29Z","timestamp":1757312009579},"reference-count":11,"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> Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words having the same Parikh matrix; these words are called \"amiable\" or \"M - equivalent\". The presented paper uses the results obtained in [3] for the binary case. The aim is to distinguish the amiable words by using a morphism that provides additional information about them. The morphism proposed here is the Istrail morphism. <\/jats:p>","DOI":"10.1142\/s0129054110007702","type":"journal-article","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T08:39:03Z","timestamp":1290587943000},"page":"1021-1033","source":"Crossref","is-referenced-by-count":8,"title":["PARIKH MATRICES, AMIABILITY AND ISTRAIL MORPHISM"],"prefix":"10.1142","volume":"21","author":[{"given":"ADRIAN","family":"ATANASIU","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Computer Science, Bucharest University, Str. Academiei 14, Bucharest 010014, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.10.022"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004735"},{"key":"rf5","first-page":"166","volume":"49","author":"Atanasiu A.","journal-title":"Fundamenta Informaticae"},{"key":"rf6","first-page":"783","volume":"7","author":"Atanasiu A.","journal-title":"Journal of Universal Computer Science"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"rf8","first-page":"301","volume":"21","author":"Istrail S.","journal-title":"Bull. Math. Soc. Sci. Math. R. S. Roumanie"},{"key":"rf9","first-page":"#A03","volume":"8","author":"Kitaev S.","journal-title":"Integers: Electronic Journal of Combinatorial Number Theory"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"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"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054110007702","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:24:20Z","timestamp":1565191460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054110007702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S0129054110007702"],"URL":"https:\/\/doi.org\/10.1142\/s0129054110007702","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}