{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:36Z","timestamp":1726452096400},"reference-count":17,"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)90082-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"35-52","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["La reconnaissance des facteurs d'un mot dans un texte"],"prefix":"10.1016","volume":"48","author":[{"given":"Jean-Claude","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0304-3975(86)90082-4_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching; an aid to bibliographic research","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(86)90082-4_BIB2","series-title":"Formal Language Theory","first-page":"325","article-title":"Pattern matching in strings","author":"Aho","year":"1980"},{"key":"10.1016\/0304-3975(86)90082-4_BIB3","first-page":"12","article-title":"Linear size finite automata for the set of all subwords of a word; an outline of results","volume":"21","author":"Blumer","year":"1983","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(86)90082-4_BIB4","series-title":"Proc. ICALP 1984","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)90082-4_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"year":"1979","series-title":"Transductions and Context-free Languages","author":"Berstel","key":"10.1016\/0304-3975(86)90082-4_BIB6"},{"issue":"10","key":"10.1016\/0304-3975(86)90082-4_BIB7","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(86)90082-4_BIB8","series-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words","first-page":"31","article-title":"Optimal factor transducers","author":"Crochemore","year":"1984"},{"issue":"1","key":"10.1016\/0304-3975(86)90082-4_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetitions","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90082-4_BIB10","first-page":"57","article-title":"Computing LCF in linear time","volume":"30","author":"Crochemore","year":"1986","journal-title":"Bull. EATCS"},{"year":"1974","series-title":"Automata, Languages and Machines","author":"Eilenberg","key":"10.1016\/0304-3975(86)90082-4_BIB11"},{"issue":"2","key":"10.1016\/0304-3975(86)90082-4_BIB12","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."},{"year":"1983","series-title":"Combinatorics on Words","author":"Lothaire","key":"10.1016\/0304-3975(86)90082-4_BIB13"},{"issue":"2","key":"10.1016\/0304-3975(86)90082-4_BIB14","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix-tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"article-title":"A linear pattern-matching algorithm","year":"1970","author":"Morris","key":"10.1016\/0304-3975(86)90082-4_BIB15"},{"key":"10.1016\/0304-3975(86)90082-4_BIB16","first-page":"541","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/0304-3975(86)90082-4_BIB17","series-title":"Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern-matching algorithms","author":"Weiner","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900824?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900824?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:54:00Z","timestamp":1553201640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":17,"alternative-id":["0304397586900824"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90082-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986]]}}}