{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:07:25Z","timestamp":1648937245811},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"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":[[1988,12]]},"DOI":"10.1016\/0304-3975(88)90116-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"341-381","source":"Crossref","is-referenced-by-count":0,"title":["La reconnaissance des facteurs d'un langage fini dans un texte en temps lineaire"],"prefix":"10.1016","volume":"60","author":[{"given":"Jean-Claude","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0304-3975(88)90116-8_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(88)90116-8_BIB2","series-title":"Formal Language Theory","first-page":"325","article-title":"Pattern matching in strings","author":"Aho","year":"1980"},{"key":"10.1016\/0304-3975(88)90116-8_BIB3","series-title":"Transductions and Context-free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/0304-3975(88)90116-8_BIB4","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(88)90116-8_BIB5","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(88)90116-8_BIB6","series-title":"Proc of 16th ACM Symp. on the Theory of Computing","first-page":"349","article-title":"Building a complete inverted file for a set of text files in linear time","author":"Blumer","year":"1984"},{"key":"10.1016\/0304-3975(88)90116-8_BIB7","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."},{"issue":"3","key":"10.1016\/0304-3975(88)90116-8_BIB8","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","article-title":"Complete inverted files for efficient text retrieval and analysis","volume":"34","author":"Blumer","year":"1987","journal-title":"J. ACM"},{"issue":"10","key":"10.1016\/0304-3975(88)90116-8_BIB9","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"},{"issue":"2","key":"10.1016\/0304-3975(88)90116-8_BIB10","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"},{"key":"10.1016\/0304-3975(88)90116-8_BIB11","first-page":"97","article-title":"Efficient and elegant subword-tree construction","author":"Chen","year":"1984","journal-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words"},{"key":"10.1016\/0304-3975(88)90116-8_BIB12","first-page":"31","article-title":"Optimal factor transducers","author":"Crochemore","year":"1984","journal-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words"},{"issue":"1","key":"10.1016\/0304-3975(88)90116-8_BIB13","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(88)90116-8_BIB14","first-page":"57","article-title":"Computing LCF in linear time","volume":"30","author":"Crochemore","year":"1986","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(88)90116-8_BIB15","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1974"},{"issue":"2","key":"10.1016\/0304-3975(88)90116-8_BIB16","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(88)90116-8_BIB17","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(88)90116-8_BIB18","series-title":"Tech. Rept. 40","article-title":"A linear pattern-matching algorithm","author":"Morris","year":"1970"},{"key":"10.1016\/0304-3975(88)90116-8_BIB19","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(88)90116-8_BIB20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(86)90082-4","article-title":"La reconnaissance des facteurs d'un mot dans un texte","volume":"48","author":"Spehner","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90116-8_BIB21","unstructured":"J.-C. Spehner, Sur les automates qui reconnaissent une famille de langages, Publication du Lab. Math-Info No. 46, Universit\u00e9 de Haute Alsace, Mulhouse, France"},{"key":"10.1016\/0304-3975(88)90116-8_BIB22","first-page":"1","article-title":"Linear pattern-matching algorithms","author":"Weiner","year":"1983","journal-title":"Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:21Z","timestamp":1555127661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0304397588901168"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90116-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}