{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:23Z","timestamp":1759637903844},"reference-count":30,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":9024,"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":[[1988,11]]},"DOI":"10.1016\/0304-3975(88)90122-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"149-174","source":"Crossref","is-referenced-by-count":19,"title":["Alternating multihead finite automata"],"prefix":"10.1016","volume":"61","author":[{"given":"K.N.","family":"King","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90122-3_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\/0304-3975(88)90122-3_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90122-3_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":"18","author":"Cook","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90122-3_BIB4","first-page":"75","article-title":"Linear time simulation of deterministic two-way pushdown automata","volume":"71","author":"Cook","year":"1972"},{"key":"10.1016\/0304-3975(88)90122-3_BIB5","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","article-title":"An observation on time-space trade-off","volume":"9","author":"Cook","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Fischer","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01683273","article-title":"Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages","volume":"10","author":"Galil","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(88)90122-3_BIB8","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0304-3975(88)90122-3_BIB9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multi-tape and multi-head pushdown automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90122-3_BIB10","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On non-determinancy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(88)90122-3_BIB11","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\/0304-3975(88)90122-3_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB14","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/S0022-0000(72)80019-9","article-title":"Pushdown automata with counters","volume":"6","author":"Kameda","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB15","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/0208046","article-title":"Classes of pebble games and complete problems","volume":"8","author":"Kasai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90122-3_BIB16","first-page":"92","article-title":"Alternating pushdown automata","author":"Ladner","year":"1978","journal-title":"Conf. Rec. IEEE 19th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90122-3_BIB17","series-title":"Proc. Coll. on Automata, Languages, and Programming","first-page":"280","article-title":"Characterizations of time-bounded computations by limited primitive recursion","volume":"14","author":"Monien","year":"1974"},{"key":"10.1016\/0304-3975(88)90122-3_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\/0304-3975(88)90122-3_BIB18_2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF00271346","article-title":"Corrigendum","volume":"8","author":"Monien","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(88)90122-3_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. Th\u00e9or."},{"key":"10.1016\/0304-3975(88)90122-3_BIB20","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"287","article-title":"The interface between language theory and complexity theory","author":"Monien","year":"1980"},{"key":"10.1016\/0304-3975(88)90122-3_BIB21","series-title":"Mathematical Foundations of Computer Science 1981","first-page":"78","article-title":"Time and space bounded complexity classes and bandwidth constrained problems","volume":"118","author":"Monien","year":"1981"},{"key":"10.1016\/0304-3975(88)90122-3_BIB22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0020-0190(82)90075-8","article-title":"A note on two-way nondeterministic pushdown automata","volume":"15","author":"Rytter","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(88)90122-3_BIB23","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."},{"key":"10.1016\/0304-3975(88)90122-3_BIB24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0208013","article-title":"Provably difficult combinatorial games","volume":"8","author":"Stockmeyer","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90122-3_BIB25","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90122-3_BIB26","first-page":"141","article-title":"On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store","author":"Sudborough","year":"1976","journal-title":"Proc. 8th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90122-3_BIB27","first-page":"208","article-title":"Separating tape bounded auxiliary pushdown automata classes","author":"Sudborough","year":"1977","journal-title":"Proc. 9th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90122-3_BIB28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1051\/ita\/1977110301811","article-title":"Some remarks on multihead automata","volume":"11","author":"Sudborough","year":"1977","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(88)90122-3_BIB29","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:47Z","timestamp":1555127687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":30,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0304397588901223"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90122-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}