{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:21:34Z","timestamp":1649128894792},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90140-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"145-164","source":"Crossref","is-referenced-by-count":0,"title":["A string-matching interpretation of the equation xmyn = zp"],"prefix":"10.1016","volume":"92","author":[{"given":"J.","family":"N\u00e9raud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Crochemore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0304-3975(92)90140-B_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(92)90140-B_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(85)90060-X","article-title":"Sur la combinatoire des codes \u00e0 deux mots","volume":"41","author":"Barbin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(92)90140-B_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0021-8693(79)90113-3","article-title":"Sur le th\u00e9or\u00e8me du d\u00e9faut","volume":"60","author":"Berstel","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/0304-3975(92)90140-B_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","article-title":"Transducers and repetition","volume":"45","author":"Crochemore","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90140-B_BIB5","series-title":"TAPSOFT'87","first-page":"26","article-title":"Longest common factor of two words","volume":"Vol. 249","author":"Crochemore","year":"1987"},{"key":"10.1016\/0304-3975(92)90140-B_BIB6","series-title":"CAAP'90","first-page":"117","article-title":"Unitary monoid with two generators: an algorithmic point of view","volume":"Vol. 431","author":"Crochemore","year":"1990"},{"key":"10.1016\/0304-3975(92)90140-B_BIB7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(79)90003-3","article-title":"P\u00e9riodes et r\u00e9p\u00e9titions des mots du monoide libre","volume":"9","author":"Duval","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90140-B_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","article-title":"Uniqueness theorem for periodic functions","volume":"16","author":"Fine","year":"1965","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(92)90140-B_BIB9","series-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"issue":"3","key":"10.1016\/0304-3975(92)90140-B_BIB10","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/28869.28875","article-title":"New applications of failure functions","volume":"34","author":"Hirschberg","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90140-B_BIB11","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(92)90140-B_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."},{"key":"10.1016\/0304-3975(92)90140-B_BIB13","series-title":"Equations dans le monoide libre","author":"Lentin","year":"1972"},{"key":"10.1016\/0304-3975(92)90140-B_BIB14","series-title":"Proc. University of North California","first-page":"128","article-title":"A combinatorial problem in the theory of free monoids","author":"Lentin","year":"1967"},{"issue":"5","key":"10.1016\/0304-3975(92)90140-B_BIB15","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1051\/ita\/1990240504591","article-title":"Elementariness of a finite set of words is co-NP-complete","volume":"24","author":"N\u00e9raud","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/0304-3975(92)90140-B_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02573374","article-title":"On the deficit of a finite set of words","volume":"41","author":"N\u00e9raud","year":"1990","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(92)90140-B_BIB17","series-title":"Algebraic Theory of Semigroups","first-page":"545","article-title":"A property of finitely generated submonoids","author":"Sch\u00fctzenberger","year":"1979"},{"key":"10.1016\/0304-3975(92)90140-B_BIB18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","article-title":"A greedy approximation algorithm for constructing shortest common superstrings","volume":"57","author":"Tarhio","year":"1988","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290140B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290140B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:31Z","timestamp":1555113391000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290140B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["030439759290140B"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90140-b","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}