{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:40:24Z","timestamp":1648564824792},"reference-count":13,"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)00093-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"77-92","source":"Crossref","is-referenced-by-count":12,"title":["Image reducing words and subgroups of free groups"],"prefix":"10.1016","volume":"307","author":[{"given":"D.S.","family":"Ananichev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Cherubini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.V.","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00093-8_BIB1","series-title":"Developments in Language Theor","first-page":"166","article-title":"Collapsing words vs. synchronizing words","volume":"Vol. 2295","author":"Ananichev","year":"2002"},{"key":"10.1016\/S0304-3975(03)00093-8_BIB2","first-page":"208","article-title":"Pozn\u00e1mka k homog\u00e9nnym eksperimentom s konecn\u00fdmi avtomatami","volume":"14","author":"\u010cern\u00fd","year":"1964","journal-title":"Mat.-Fyz. Cas. Slovensk. Akad. Vied."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/1969513","article-title":"A topology for free group and related groups","volume":"52","author":"Hall","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB4","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1006\/jabr.2001.9033","article-title":"Stallings foldings and subgroups of free groups","volume":"248","author":"Kapovich","year":"2002","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(03)00093-8_BIB5","first-page":"146","article-title":"A counter example to a conjecture concerning synchronizing words in finite automata","volume":"73","author":"Kari","year":"2001","journal-title":"EATCS Bull."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB6","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/S0304-3975(03)00093-8_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S021819679300007X","article-title":"Free inverse monoids and graph immersions","volume":"3","author":"Margolis","year":"1993","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB8","doi-asserted-by":"crossref","unstructured":"S. Margolis, J.-E. Pin, M.V. Volkov, Words guaranteeing minimal image, in: M. Ito (Ed.), Proc. III Internat. Colloq. on Words, Languages and Combinatorics, World Scientific, Singapore, 2003, in press.","DOI":"10.1142\/9789812704979_0023"},{"key":"10.1016\/S0304-3975(03)00093-8_BIB9","series-title":"Le Probl\u00e8me de la Synchronisation. Contribution \u00e0 l\u2019\u00c9tude de la Conjecture de \u010cern\u00fd","author":"Pin","year":"1978"},{"key":"10.1016\/S0304-3975(03)00093-8_BIB10","first-page":"283","article-title":"Sur les mots synchronisants dans un automate fini","volume":"14","author":"Pin","year":"1978","journal-title":"Elektron. Informationverarb. Kybernet."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB11","first-page":"171","article-title":"Composing functions to reduce image size","volume":"31","author":"Sauer","year":"1991","journal-title":"Ars. Combin."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB12","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02095993","article-title":"Topology of finite graphs","volume":"71","author":"Stallings","year":"1971","journal-title":"Inv. Math."},{"key":"10.1016\/S0304-3975(03)00093-8_BIB13","series-title":"Abstrakte Automaten","author":"Starke","year":"1969"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000938?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000938?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T03:28:32Z","timestamp":1553657312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503000938"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00093-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}