{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:13Z","timestamp":1742591413542,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194880"},{"type":"electronic","value":"9783540392910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19488-6_141","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:14:35Z","timestamp":1330200875000},"page":"547-560","source":"Crossref","is-referenced-by-count":0,"title":["La Reconnaissance Des Facteurs D'un Langage Fini Dans Un Texte En Temps Lineaire - Resume -"],"prefix":"10.1007","author":[{"given":"Jean-Claude","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"6","key":"39_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and M.J. Corasick, Efficient string matching; an aid to bibliographic research, Comm. ACM 18(6) (1975) 333\u2013340.","journal-title":"Comm. ACM"},{"key":"39_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/B978-0-12-115350-2.50016-6","volume-title":"Formal Language Theory","author":"A.V. Aho","year":"1980","unstructured":"A.V. Aho, Pattern matching in strings, in: R.V. Book, ed., Formal Language Theory (Academic Press, New York, 1980) 325\u2013347."},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel, Transductions and Context-free Languages (Teubner, Stuttgart, 1979).","DOI":"10.1007\/978-3-663-09367-1"},{"key":"39_CR4","first-page":"12","volume":"21","author":"A. Blumer","year":"1983","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell, Linear size finite automata for the set of all subwords of a word; an outline of results, Bull. EATCS 21 (1983) 12\u201320.","journal-title":"Bull. EATCS"},{"key":"39_CR5","series-title":"Lectures Notes in Computer Sciences","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-13345-3_9","volume-title":"Building the minimal DFA for the set of all subwords of a word on-line in linear time","author":"A. Blumer","year":"1984","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell, Building the minimal DFA for the set of all subwords of a word on-line in linear time, Proc. ICALP 1984, Lectures Notes in Computer Sciences 172 (Springer, Berlin, 1984) 109\u2013118."},{"key":"39_CR6","first-page":"349","volume-title":"Building a complete inverted file for a set of text files in linear time","author":"A. Blumer","year":"1984","unstructured":"A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell, Building a complete inverted file for a set of text files in linear time, Proc of 16th ACM Symposium on the Theory of Computing, ACM, New-York, 1984, 349\u2013358."},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M.T. Chen and J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci. 40 (1985) 31\u201355.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"39_CR8","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, D. Haussler, R. McConnell and A. Ehrenfeucht, Complete inverted files for efficient text retrivial and analysis, J. ACM 34(3) (1987) 578\u2013595.","journal-title":"J. ACM"},{"issue":"10","key":"39_CR9","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"R.S. Boyer and J.S. Moore, A fast string searching algorithm, Comm. ACM 20(10) (1977) 762\u2013772.","journal-title":"Comm. ACM"},{"issue":"2","key":"39_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"E.M. McCreight, A space-economical suffix-tree construction algorithm, J. ACM 23(2) (1976) 262\u2013272.","journal-title":"J. ACM"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"M.T. Chen and J. Seiferas, Efficient and elegant subword-tree construction, Proc. NATO advanced Research Workshop on Combinatorial Algorithms on words, Maratea, Italy (1984), 97\u2013107.","DOI":"10.1007\/978-3-642-82456-2_7"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"M. Crochemore, Optimal factor transducers, Proc. NATO Advanced Research Worship on Combinatorial Algorithms on Words, Maratea, Italy (1984) 31\u201343.","DOI":"10.1007\/978-3-642-82456-2_3"},{"issue":"1","key":"39_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci. 45(1) (1986) 63\u201386.","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR14","first-page":"57","volume":"30","author":"M. Crochemore","year":"1986","unstructured":"M. Crochemore, Computing LCF in linear time, Bull. EATCS 30 (1986) 57\u201361.","journal-title":"Bull. EATCS"},{"key":"39_CR15","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines (Academic Press, New-York 1974)."},{"issue":"2","key":"39_CR16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern-matching in strings, SIAM J. Comput. 6(2) (1977) 323\u2013350.","journal-title":"SIAM J. Comput."},{"key":"39_CR17","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire, Combinatorics on Words (Addison-Wesley, Reading, MA, 1983)."},{"key":"39_CR18","series-title":"Tech. Rept.","volume-title":"A linear pattern-matching algorithm","author":"J.H. Morris","year":"1970","unstructured":"J.H. Morris and V.R. Pratt, A linear pattern-matching algorithm, Tech. Rept. 40, Computing Center, University of California, Berkeley, CA (1970)."},{"key":"39_CR19","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"A. Nerode, Linear automaton transformations, Proc. Amer. Math. Soc. 9 (1958) 541\u2013544.","journal-title":"Proc. Amer. Math. Soc."},{"key":"39_CR20","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(86)90082-4","volume":"48","author":"J.C. Spehner","year":"1986","unstructured":"J.C. Spehner, La reconnaissance des facteurs d'un mot dans un texte, TCS 48 (1986) 35\u201352.","journal-title":"TCS"},{"key":"39_CR21","unstructured":"J.C. Spehner, Sur les automates qui'reconnaissent une famille de languages, Publication du Labo. Math-Info no 45, Universit\u00e9 de Haute Alsace (Mulhouse)."},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern-matching algorithms, Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory, Iowa, U.S.A. (1983) 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19488-6_141.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:44:42Z","timestamp":1742589882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19488-6_141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194880","9783540392910"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-19488-6_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}