{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T17:11:44Z","timestamp":1714151504539},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":4184,"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":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00433-3","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"47-67","source":"Crossref","is-referenced-by-count":14,"title":["Shuffle factorization is unique"],"prefix":"10.1016","volume":"273","author":[{"given":"Jean","family":"Berstel","sequence":"first","affiliation":[]},{"given":"Luc","family":"Boasson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00433-3_BIB1","unstructured":"C. Allauzen, Calcul efficace du shuffle de k mots, Tech. Report IGM2000-02, Institut Gaspard Monge, Universit\u00e9 Marne-la-Vall\u00e9e, 2000."},{"key":"10.1016\/S0304-3975(00)00433-3_BIB2","unstructured":"M. Lothaire, Combinatorics on Words, Encyclopaedia of Mathematics and its Applications, vol. 17, Addison-Wesley, Reading, MA, 1983 (Reprinted in the Cambridge Mathematical Library, Cambridge University Press, Cambridge, 1997)."},{"key":"10.1016\/S0304-3975(00)00433-3_BIB3","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S0129626494000429","article-title":"Efficient parallel shuffle recognition","volume":"4","author":"Nivat","year":"1994","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0304-3975(00)00433-3_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/00207169808804693","article-title":"A constant time string shuffle algorithm on reconfigurable meshes","volume":"68","author":"Pradeep","year":"1998","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0304-3975(00)00433-3_BIB5","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0021-8693(79)90171-6","article-title":"A natural ring basis for the shuffle algebra and an application to group schemes","volume":"58","author":"Radford","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(00)00433-3_BIB6","series-title":"Free Lie Algebras, London Mathematical Society Monographs","author":"Reutenauer","year":"1993"},{"key":"10.1016\/S0304-3975(00)00433-3_BIB7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(86)90145-3","article-title":"Le calcul rapide des m\u00e9langes de deux mots. (Fast computing of the shuffle of two words)","volume":"47","author":"Spehner","year":"1986","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500004333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:25:30Z","timestamp":1556864730000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500004333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500004333"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00433-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}