{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:46:40Z","timestamp":1648745200269},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"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":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00101-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:52:06Z","timestamp":1048611126000},"page":"199-215","source":"Crossref","is-referenced-by-count":0,"title":["The homomorphism problem for trace monoids"],"prefix":"10.1016","volume":"307","author":[{"given":"Pedro V.","family":"Silva","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00101-4_BIB1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02572484","article-title":"Some algorithms on the star operation applied to finite languages","volume":"28","author":"Almeida","year":"1984","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB3","unstructured":"J.W. Cannon, D.B.A. Epstein, D.F. Holt, S.V.F. Levy, M.S. Paterson, W.P. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, 1992."},{"key":"10.1016\/S0304-3975(03)00101-4_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(96)00311-8","article-title":"A note on decidability questions of word semigroups","volume":"183","author":"Choffrut","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00101-4_BIB5","series-title":"The Book of Traces","author":"Diekert","year":"1995"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","article-title":"Synchronized rational relations of finite and infinite words","volume":"108","author":"Frougny","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00101-4_BIB7","series-title":"Semigroups: An Introduction to the Structure Theory","author":"Grillet","year":"1995"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB8","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB9","series-title":"Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations","author":"Magnus","year":"1966"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02572962","article-title":"On finitely generated subsemigroups of a free semigroup","volume":"3","author":"Markov","year":"1971","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0890-5401(87)90020-4","article-title":"Easy multiplications I. The realm of Kleene's theorem","volume":"74","author":"Sakarovitch","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00101-4_BIB12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(02)00380-1","article-title":"The homomorphism problem for the free monoid","volume":"259","author":"Silva","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00101-4_BIB13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF02194863","article-title":"Quelques constructions et algorithmes relatifs aux sous-mono\u0131\u0308 des d'un mono\u0131\u0308 de libre","volume":"9","author":"Spehner","year":"1975","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0304-3975(03)00101-4_BIB14","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1051\/ita:2001103","article-title":"On graph products of automatic monoids","volume":"35","author":"Veloso da Costa","year":"2001","journal-title":"Theoret. Inform. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503001014?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:28:30Z","timestamp":1553671710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503001014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503001014"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00101-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}