{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:53:15Z","timestamp":1710251595941},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1995,2]]},"DOI":"10.1016\/0167-8655(94)00091-g","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"179-182","source":"Crossref","is-referenced-by-count":11,"title":["A note on parsing pattern languages"],"prefix":"10.1016","volume":"16","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Chuen","family":"Pong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen M.","family":"Sohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(94)00091-G_BIB1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01758848","article-title":"Optimal parallel detection of squares in strings","volume":"8","author":"Apostolico","year":"1992","journal-title":"Algorithmics"},{"key":"10.1016\/0167-8655(94)00091-G_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10.1016\/0167-8655(94)00091-G_BIB3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"issue":"7","key":"10.1016\/0167-8655(94)00091-G_BIB4","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/365719.365971","article-title":"Algorithm 288: solution of simultaneous linear diophantine equations [F4]","volume":"9","author":"Blankinship","year":"1986","journal-title":"Comm. ACM."},{"issue":"7","key":"10.1016\/0167-8655(94)00091-G_BIB5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1145\/362686.362694","article-title":"Algorithm and bound for the greatest common divisor of n integers","volume":"13","author":"Bradley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8655(94)00091-G_BIB6","article-title":"Finding all periods and initial palindromes of a string in parallel","author":"Breslauer","year":"1992"},{"key":"10.1016\/0167-8655(94)00091-G_BIB7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8655(94)00091-G_BIB8","article-title":"Introcuction to Formal Language Theory","author":"Harrison","year":"1978"},{"issue":"3","key":"10.1016\/0167-8655(94)00091-G_BIB9","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski's convex body theorem and integer programming","volume":"12","author":"Kannan","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-8655(94)00091-G_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0022-0000(87)90006-7","article-title":"A note on the two-variable pattern-finding problem","volume":"34","author":"Ko","year":"1987","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/0167-8655(94)00091-G_BIB11","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":"1","key":"10.1016\/0167-8655(94)00091-G_BIB12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/0132018","article-title":"Upper bound on the number of nonnegative integer solutions to a linear equation","volume":"32","author":"Lambe","year":"1977","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/0167-8655(94)00091-G_BIB13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-8655(94)00091-G_BIB14","series-title":"An Introduction to the Theory of Numbers","author":"Niven","year":"1980"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559400091G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559400091G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:26:20Z","timestamp":1555568780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559400091G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["016786559400091G"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(94)00091-g","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}