{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:56:29Z","timestamp":1726415789680},"reference-count":38,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"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":9055,"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":[[1988,10]]},"DOI":"10.1016\/0022-0000(88)90004-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"144-155","source":"Crossref","is-referenced-by-count":11,"title":["k+ 1Heads are better than k for PDAs"],"prefix":"10.1016","volume":"37","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(88)90004-9_BIB1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(68)91087-5","article-title":"Time and tape complexity of pushdown automaton languages","volume":"13","author":"Aho","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(88)90004-9_BIB2_1","series-title":"12th Int. Colloq. Automata, Lang. Programming","first-page":"101","article-title":"Hierarchies of one-way multihead automata languages","volume":"Vol. 194","author":"Chrobak","year":"1986"},{"key":"10.1016\/0022-0000(88)90004-9_BIB2_2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(86)90093-9","volume":"48","author":"Chrobak","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(88)90004-9_BIB3","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"13","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(88)90004-9_BIB4","first-page":"280","article-title":"Review 14","volume":"9","author":"Floyd","year":"1968","journal-title":"Comput. Rev."},{"key":"10.1016\/0022-0000(88)90004-9_BIB5","series-title":"Proceedings, 18th ACM Symp. Theory of Comput.","first-page":"39","article-title":"On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines","author":"Galil","year":"1986"},{"key":"10.1016\/0022-0000(88)90004-9_BIB6","series-title":"Proceedings, 6th Symp. on Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Hartmanis","year":"1965"},{"key":"10.1016\/0022-0000(88)90004-9_BIB7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multi-head and multi-tape pushdown automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Inform. and Control"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/0022-0000(88)90004-9_BIB8"},{"article-title":"Generalizations of Pushdown Automata","year":"1967","author":"Ibarra","key":"10.1016\/0022-0000(88)90004-9_BIB9"},{"key":"10.1016\/0022-0000(88)90004-9_BIB10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","article-title":"On two-way multihead automata","volume":"7","author":"Ibarra","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(88)90004-9_BIB11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00288748","article-title":"On 3-head versus 2 head finite automata","volume":"4","author":"Ibarra","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(88)90004-9_BIB12","unstructured":"M. Li, Lower bounds on string-matching, submitted for publication, 1984."},{"article-title":"Lower bounds in computational complexity","year":"1985","author":"Li","key":"10.1016\/0022-0000(88)90004-9_BIB13"},{"key":"10.1016\/0022-0000(88)90004-9_BIB14","first-page":"219","article-title":"On the power of the queue, \u201cStructure in Complexity Theory,\u201d","volume":"Vol. 223","author":"Li","year":"1986"},{"key":"10.1016\/0022-0000(88)90004-9_BIB15","unstructured":"M. Li And P. M. B. Vitanyi, Tape versus queue and stacks: The lower bounds, submitted for publication."},{"key":"10.1016\/0022-0000(88)90004-9_BIB16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00262976","article-title":"A hierarchy theorem for multihead stack-counter automata","volume":"17","author":"Miyano","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(88)90004-9_BIB17","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0022-0000(83)90032-6","article-title":"Remarks on multihead pushdown automata and multihead stack automata","volume":"27","author":"Miyano","year":"1983","journal-title":"J. Comput. and System Sciences"},{"key":"10.1016\/0022-0000(88)90004-9_BIB18_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00263746","article-title":"Transformational methods and their application to complexity problems","volume":"6","author":"Monien","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(88)90004-9_BIB18_2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00271346","article-title":"Corrigenda","volume":"8","author":"Monien","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(88)90004-9_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","article-title":"Two-way multihead automata over a one-letter alphabet","volume":"14","author":"Monien","year":"1980","journal-title":"RAIRO Inform. Theor."},{"issue":"No. 2","key":"10.1016\/0022-0000(88)90004-9_BIB20","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1090\/S0002-9947-1985-0808746-4","article-title":"Combinatorial lower bound arguments for deterministic and nondeterministic onetape Turing machines","volume":"292","author":"Maass","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(88)90004-9_BIB21","series-title":"Structure in Complexity Theory","first-page":"249","article-title":"An optimal lower bound for Turing machines with one work tape and a two-way input tape","volume":"Vol. 223","author":"Maass","year":"1986"},{"article-title":"One-Way Automata on Bounded Languages","year":"1976","author":"Nelson","key":"10.1016\/0022-0000(88)90004-9_BIB22"},{"key":"10.1016\/0022-0000(88)90004-9_BIB23","series-title":"2nd International Conference on Fundamentals of Computations Theory","article-title":"Kolmogorov complexity and lower bounds","author":"Paul","year":"1979"},{"key":"10.1016\/0022-0000(88)90004-9_BIB24","series-title":"Proceedings, 23rd IEEE Found. of Comput. Sci.","first-page":"53","article-title":"On-line simulation of k + 1 tapes by k tapes requires nonlinear time","author":"Paul","year":"1982"},{"key":"10.1016\/0022-0000(88)90004-9_BIB25","series-title":"Proceedings, 24th IEEE Found. of Comput. Sci.","first-page":"343","article-title":"Lower bounds on the time of probabilistic on-line simulations","author":"Paturi","year":"1982"},{"key":"10.1016\/0022-0000(88)90004-9_BIB26","series-title":"Proceedings, 12th ACM Symp. Theory of Comput.","first-page":"357","article-title":"An information-theoretic approach to time bounds for online computations","author":"Paul","year":"1980"},{"article-title":"n-Head Finite State Machines","year":"1963","author":"Piatkowski","key":"10.1016\/0022-0000(88)90004-9_BIB27"},{"article-title":"Nonwriting Extensions of Finite Automatap","year":"1965","author":"Rosenberg","key":"10.1016\/0022-0000(88)90004-9_BIB28"},{"key":"10.1016\/0022-0000(88)90004-9_BIB29","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1147\/rd.105.0388","article-title":"On multihead finite automata","volume":"10","author":"Rosenberg","year":"1966","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0022-0000(88)90004-9_BIB30","series-title":"Proceedings, 23rd IEEE Found. of Comput. Sci.","first-page":"45","article-title":"Three applications of Kolmogorov-complexity","author":"Reich","year":"1982"},{"key":"10.1016\/0022-0000(88)90004-9_BIB31","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(84)90125-X","article-title":"On the power of real-time two-way multihead finite automata with jumps","volume":"19","author":"Savitch","year":"1984","journal-title":"Inform. Process Lett."},{"article-title":"Nondeterministic Time and Space Complexity Classes","year":"1974","author":"Seiferas","key":"10.1016\/0022-0000(88)90004-9_BIB32"},{"key":"10.1016\/0022-0000(88)90004-9_BIB33","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","article-title":"Relating refined space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"article-title":"Computation by Multi-Head Writing Finite Automata","year":"1974","author":"Sudborough","key":"10.1016\/0022-0000(88)90004-9_BIB34"},{"key":"10.1016\/0022-0000(88)90004-9_BIB35_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90426-5","article-title":"One-way multihead writing finite automata","volume":"30","author":"Sudborough","year":"1976","journal-title":"Inform. and Control"},{"year":"1971","author":"Sudborough","key":"10.1016\/0022-0000(88)90004-9_BIB35_2"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900049?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000088900049?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:54:17Z","timestamp":1550325257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000088900049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["0022000088900049"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(88)90004-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[1988,10]]}}}