{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T17:05:45Z","timestamp":1771866345462,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00396-7","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T07:31:32Z","timestamp":1060327892000},"page":"233-246","source":"Crossref","is-referenced-by-count":39,"title":["Extending Parikh matrices"],"prefix":"10.1016","volume":"310","author":[{"given":"Traian-Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S0304-3975(03)00396-7_BIB1","first-page":"783","article-title":"Codifiable languages and the Parikh matrix mapping","volume":"7","author":"Atanasiu","year":"2001","journal-title":"J. Universal Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00396-7_BIB2","first-page":"1","article-title":"On the injectivity of the Parikh matrix mapping","volume":"46","author":"Atanasiu","year":"2001","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(03)00396-7_BIB3","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1051\/ita:2001131","article-title":"A Sharpening of the Parikh Mapping","volume":"35","author":"Mateescu","year":"2001","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"},{"key":"10.1016\/S0304-3975(03)00396-7_BIB4","unstructured":"A. Mateescu, A. Salomaa, K. Salomaa, Yu Sheng, On an extension of the Parikh mapping, TUCS Technical Report No. 364, September 2000."},{"key":"10.1016\/S0304-3975(03)00396-7_BIB5","unstructured":"A. Mateescu, A. Salomaa, Yu Sheng, Subword Histories and Parikh Matrices, TUCS Technical Report No. 442, February 2002."},{"key":"10.1016\/S0304-3975(03)00396-7_BIB6","doi-asserted-by":"crossref","unstructured":"G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-642-59126-6"},{"key":"10.1016\/S0304-3975(03)00396-7_BIB7","series-title":"Combinatorics on Words","first-page":"105","article-title":"Subwords","author":"Sakarovitch","year":"1983"},{"key":"10.1016\/S0304-3975(03)00396-7_BIB8","series-title":"Formal Languages","author":"Salomaa","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003967?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503003967?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:00:00Z","timestamp":1552608000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503003967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0304397503003967"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00396-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}