{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:34:07Z","timestamp":1757615647760,"version":"3.44.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,4]],"date-time":"2004-03-04T00:00:00Z","timestamp":1078358400000},"content-version":"vor","delay-in-days":6547,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90099-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"231-235","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["String-matching cannot be done by a two-head one-way deterministic finite automaton"],"prefix":"10.1016","volume":"22","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[]},{"given":"Yaacov","family":"Yesha","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(86)90099-2_BIB1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(82)90087-1","article-title":"Fooling a two-way automaton or one pushdown store is better than one counter for two way machines","volume":"21","author":"Du\u0159i\u0161","year":"1982","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0020-0190(86)90099-2_BIB2","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","article-title":"Time-space optimal string-matching","volume":"26","author":"Galil","year":"1983","journal-title":"J. Comput. System Sci."},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcrpft","key":"10.1016\/0020-0190(86)90099-2_BIB3"},{"article-title":"String-matching cannot be done by a two-head one-way deterministic finite automaton","year":"1983","author":"Li","key":"10.1016\/0020-0190(86)90099-2_BIB4"},{"article-title":"Lower bounds on string-matching","year":"1984","author":"Li","key":"10.1016\/0020-0190(86)90099-2_BIB5"},{"key":"10.1016\/0020-0190(86)90099-2_BIB6","series-title":"2nd Internat. Conf. on Fundamentals of Computation Theory","article-title":"Kolmogorov complexity and lower bounds","author":"Paul","year":"1979"},{"key":"10.1016\/0020-0190(86)90099-2_BIB7","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322076","article-title":"k + 1 heads are better than k","volume":"25","author":"Yao","year":"1978","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900992?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900992?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:53Z","timestamp":1757084333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900992"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90099-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1986,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"String-matching cannot be done by a two-head one-way deterministic finite automaton","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(86)90099-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}