{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:39:50Z","timestamp":1648697990862},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/s0022-0000(05)80020-0","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Three one-way heads cannot do string matching"],"prefix":"10.1016","volume":"48","author":[{"given":"Mih\u00e1ly","family":"Ger\u00e9b-Graus","sequence":"first","affiliation":[]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 10","key":"10.1016\/S0022-0000(05)80020-0_bib1","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\/S0022-0000(05)80020-0_bib2","series-title":"Proceedings, IFIP Congress 71","first-page":"172","article-title":"Linear time simulation of deterministic two-way pushdown automata","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(05)80020-0_bib3","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":"Duris","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80020-0_bib4","series-title":"Combinatorial Algorithms in Words","first-page":"1","article-title":"Open problems in stringology","author":"Galil","year":"1985"},{"key":"10.1016\/S0022-0000(05)80020-0_bib5","series-title":"Proceedings, 13th ACM Symp. on Theory of Computing","first-page":"106","article-title":"Time-space-optimal string matching","author":"Galil","year":"1981"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80020-0_bib6","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\/S0022-0000(05)80020-0_bib7","series-title":"Lower bounds on string-matching, manuscript","author":"Li","year":"1985"},{"key":"10.1016\/S0022-0000(05)80020-0_bib8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(86)90099-2","article-title":"String-matching cannot be done by a two-head one-way deterministic finite automaton","volume":"22","author":"Li","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80020-0_bib9","series-title":"Proceedings, IEEE 3rd Structure in Complexity Theory Conference","first-page":"80","article-title":"Two decades of Kolmogorov complexity","author":"Li","year":"1988"},{"issue":"No. 1","key":"10.1016\/S0022-0000(05)80020-0_bib10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0890-5401(88)90003-X","article-title":"Tape versus queue and stacks: The lower bounds","volume":"78","author":"Li","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80020-0_bib11","doi-asserted-by":"crossref","unstructured":"W. Maass, Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines, Trans. Amer. Math. Soc. 292, 675\u2013693.","DOI":"10.1090\/S0002-9947-1985-0808746-4"},{"key":"10.1016\/S0022-0000(05)80020-0_bib12","series-title":"2nd International Conference on Fundamentals of Computation Theory","article-title":"Kolmogorov complexity and lower bounds","author":"Paul","year":"1979"},{"key":"10.1016\/S0022-0000(05)80020-0_bib13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0022-0000(81)90009-X","article-title":"An information theoretic approach to time bounds for on-line computations","volume":"23","author":"Paul","year":"1981","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0022-0000(05)80020-0_bib14","series-title":"Proceedings, 23rd IEEE Symp. on Foundations of Computer Science","first-page":"45","article-title":"Three applications of Kolmogorov-complexity","author":"Reisch","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:48Z","timestamp":1548196068000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["S0022000005800200"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80020-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}