{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:07:52Z","timestamp":1648919272225},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0304-3975(98)00163-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"329-335","source":"Crossref","is-referenced-by-count":5,"title":["A proof of choffrut's theorem on subsequential functions"],"prefix":"10.1016","volume":"215","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Reutenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00163-7_BIB1","series-title":"Transductions and context-free languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(98)00163-7_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(96)00319-2","article-title":"The suffix tree of a tree and minimizing sequential transducers","volume":"191","author":"Breslauer","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00163-7_BIB3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-09510-1_8","article-title":"A generalization of Ginsburg and Rose's characterization of g-s-m mappings","volume":"71","author":"Choffrut","year":"1979","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00163-7_BIB4","article-title":"Automata","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(98)00163-7_BIB5","series-title":"Word Processing in Groups","author":"Epstein","year":"1992"},{"key":"10.1016\/S0304-3975(98)00163-7_BIB6","article-title":"Minimization algorithms for sequential transducers","author":"Mohri","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00163-7_BIB7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-53414-8_30","article-title":"Subsequential functions: characterizations, minimization, examples","volume":"464","author":"Reutenauer","year":"1990","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00163-7_BIB8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0220042","article-title":"Minimization of rational word functions","volume":"20","author":"Reutenauer","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001637?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001637?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:51:04Z","timestamp":1555375864000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397598001637"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00163-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}