{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:48Z","timestamp":1759638948157},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90145-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"181-203","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Le calcul rapide des melanges de deux mots"],"prefix":"10.1016","volume":"47","author":[{"given":"Jean-Claude","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90145-3_BIB1","series-title":"Formal Language Theory","first-page":"325","article-title":"Pattern matching in strings","author":"Aho","year":"1980"},{"key":"10.1016\/0304-3975(86)90145-3_BIB2","article-title":"Comparison of algorithms controlling concurrent access to a database: A combinatorial approach","author":"Arques","year":"1985","journal-title":"Rapport de recherche, Univ. de Haute Alsace No. 38"},{"key":"10.1016\/0304-3975(86)90145-3_BIB3","series-title":"Proc. ICALP'84","first-page":"109","article-title":"Building the minimal DFA for the set of all subwords of a word on-line in linear time","volume":"172","author":"Blumer","year":"1984"},{"key":"10.1016\/0304-3975(86)90145-3_BIB4","series-title":"Combinatorics on Words","first-page":"31","article-title":"Optimal factor transducers","author":"Crochemore","year":"1984"},{"key":"10.1016\/0304-3975(86)90145-3_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(86)90145-3_BIB6","article-title":"Une approche quantitative de l'exclusion mutuelle","author":"Fran\u00e7on","year":"1985","journal-title":"Rapport de recherche, Univ. de haute Alsace No. 26"},{"key":"10.1016\/0304-3975(86)90145-3_BIB7","unstructured":"aussi RAIRO Inform. Th\u00e9or. \u00e0 para\u00eetre."},{"key":"10.1016\/0304-3975(86)90145-3_BIB8","article-title":"S\u00e9rialisabilit\u00e9, commutation, m\u00e9lange et tableaux de Young","author":"Fran\u00e7on","year":"1985","journal-title":"Rapport de recherche, Univ. de Haute Alsace No. 27"},{"key":"10.1016\/0304-3975(86)90145-3_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern-matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90145-3_BIB10","article-title":"Efficient recognition of rational relations","author":"Van Leeuwen","year":"1981","journal-title":"Publication LITP, Univ. Paris VI, No. 81-30"},{"key":"10.1016\/0304-3975(86)90145-3_BIB11","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/0304-3975(86)90145-3_BIB12","series-title":"Proc. 14th Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586901453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:53:19Z","timestamp":1553172799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586901453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":12,"alternative-id":["0304397586901453"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90145-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}