{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T22:52:43Z","timestamp":1782168763159,"version":"3.54.5"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90157-4","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:32:36Z","timestamp":1054074756000},"page":"31-55","source":"Crossref","is-referenced-by-count":237,"special_numbering":"C","title":["The smallest automation recognizing the subwords of a text"],"prefix":"10.1016","volume":"40","author":[{"given":"A.","family":"Blumer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Blumer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D.","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Ehrenfeucht","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.T.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Seiferas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0304-3975(85)90157-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(85)90157-4_BIB2","article-title":"Some linear time algorithms for string statistics problems","volume":"176","author":"Apostolico","year":"1979"},{"key":"10.1016\/0304-3975(85)90157-4_BIB3","series-title":"Advances in Control","first-page":"558","article-title":"Fast applications of suffix trees","author":"Apostolico","year":"1980"},{"key":"10.1016\/0304-3975(85)90157-4_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90157-4_BIB5","series-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words","article-title":"The myriad virtues of suffix trees","author":"Apostolico","year":"1984"},{"key":"10.1016\/0304-3975(85)90157-4_BIB6","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. Europ. Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90157-4_BIB7","series-title":"Proc. 16th ACM Symp. on 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(85)90157-4_BIB8","article-title":"Correctness and linearity of the on-line directed acyclic word graph algorithm","author":"Blumer","year":"1984"},{"issue":"10","key":"10.1016\/0304-3975(85)90157-4_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"},{"key":"10.1016\/0304-3975(85)90157-4_BIB10","first-page":"10","article-title":"Efficient and elegant subword-tree construction","author":"Chen","year":"1983"},{"key":"10.1016\/0304-3975(85)90157-4_BIB11","series-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words","article-title":"Efficient and elegant subword-tree construction","author":"Chen","year":"1984"},{"key":"10.1016\/0304-3975(85)90157-4_BIB12","series-title":"Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words","article-title":"Optimal factor transducers","author":"Crochemore","year":"1984"},{"key":"10.1016\/0304-3975(85)90157-4_BIB13","series-title":"11th Internat. Colloq. on Automata, Languages, and Programming","article-title":"Linear searching for a square in a word","author":"Crochemore","year":"1984"},{"key":"10.1016\/0304-3975(85)90157-4_BIB14","unstructured":"M. Crochemore, Personal communication, 1984."},{"key":"10.1016\/0304-3975(85)90157-4_BIB15","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(85)90157-4_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."},{"issue":"4","key":"10.1016\/0304-3975(85)90157-4_BIB17","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/0209061","article-title":"Efficient on-line construction and correction of position trees","volume":"9","author":"Majster","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0304-3975(85)90157-4_BIB18","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"CcCreight","year":"1976","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0304-3975(85)90157-4_BIB19","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA\u2014practical algorithm to retrieve information coded in alphanumeric","volume":"15","author":"Morrison","year":"1968","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90157-4_BIB20","first-page":"541","article-title":"Linear automaton transformation","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/0304-3975(85)90157-4_BIB21","series-title":"Improvements and applications for the Weiner repetition finder","author":"Pratt","year":"1975"},{"issue":"1","key":"10.1016\/0304-3975(85)90157-4_BIB22","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","article-title":"Linear algorithm for data compression via string matching","volume":"28","author":"Rodeh","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(85)90157-4_BIB23","article-title":"String-matching in real time","author":"Slisenko","year":"1977"},{"key":"10.1016\/0304-3975(85)90157-4_BIB24","series-title":"Proc. 7th Symp. on Mathematical Foundations of Computer Science","first-page":"493","article-title":"String matching in real time: Some properties of the data structure","volume":"64","author":"Slisenko","year":"1978"},{"issue":"2","key":"10.1016\/0304-3975(85)90157-4_BIB25","first-page":"392","article-title":"Determination in real time of all the periodicities in a word","volume":"21","author":"Slisenko","year":"1980","journal-title":"Sov. Math. Dokl."},{"issue":"3","key":"10.1016\/0304-3975(85)90157-4_BIB26_1","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1007\/BF01084395","article-title":"Detection of periodicities and string matching in real time","volume":"22","author":"Slisenko","year":"1983","journal-title":"J. Sov. Math."},{"key":"10.1016\/0304-3975(85)90157-4_BIB26_2","first-page":"62","article-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im","volume":"105","author":"Slisenko","year":"1980","journal-title":"V.A. Steklov AN SSSR"},{"issue":"6","key":"10.1016\/0304-3975(85)90157-4_BIB27","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0031-3203(81)90001-7","article-title":"A method for detecting structure in polygons","volume":"13","author":"Tanimoto","year":"1981","journal-title":"Pattern Recognition"},{"key":"10.1016\/0304-3975(85)90157-4_BIB28","series-title":"IEEE 14th Ann. 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":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901574?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901574?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T21:54:19Z","timestamp":1553118859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":29,"alternative-id":["0304397585901574"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90157-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}