{"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":1771024291118,"version":"3.50.1"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,4]]},"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 the binary words having the same Parikh matrix; these words are called \"amiable\" Some results concerning the conditions when the equivalence classes of amiable words have more than one element, a characterization theorem concerning a graph associated to an equivalence class of amiable words, and some basic properties of a rank distance defined on these classes are the main subjects considered here. <\/jats:p>","DOI":"10.1142\/s0129054107004735","type":"journal-article","created":{"date-parts":[[2007,4,10]],"date-time":"2007-04-10T07:26:04Z","timestamp":1176189964000},"page":"387-400","source":"Crossref","is-referenced-by-count":42,"title":["BINARY AMIABLE WORDS"],"prefix":"10.1142","volume":"18","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":"rf1","first-page":"166","volume":"49","author":"Atanasiu A.","journal-title":"Fundamenta Informaticae"},{"key":"rf2","first-page":"783","volume":"7","author":"Atanasiu A.","journal-title":"Journal of Universal Computer Science"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002418"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001131"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6"},{"key":"rf9","author":"Salomaa A.","journal-title":"Theoretical Computer Science"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107004735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:42:30Z","timestamp":1565124150000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107004735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":8,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1142\/S0129054107004735"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107004735","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}