{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:49:25Z","timestamp":1760078965934},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"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":[[1983,8]]},"DOI":"10.1016\/0022-0000(83)90032-6","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"116-124","source":"Crossref","is-referenced-by-count":9,"title":["Remarks on multihead pushdown automata and multihead stack automata"],"prefix":"10.1016","volume":"27","author":[{"given":"Satoru","family":"Miyano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90032-6_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01768474","article-title":"Non-principali\u00e9 du cylindre des languages a compteur","volume":"11","author":"Autebert","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(83)90032-6_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01768473","article-title":"Le cylindre des languages lin\u00e9aires","volume":"11","author":"Boasson","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(83)90032-6_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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90032-6_BIB4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1051\/ita\/1979130302411","article-title":"On simple representations of language families","volume":"13","author":"Culik","year":"1979","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90032-6_BIB5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90032-6_BIB6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0202025","article-title":"The hardest context-free language","volume":"2","author":"Greibach","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90032-6_BIB7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0203009","article-title":"Jump PDAs and hierarchies of deterministic context-free languages","volume":"3","author":"Greibach","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(83)90032-6_BIB8","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. Control"},{"key":"10.1016\/0022-0000(83)90032-6_BIB9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(71)80029-6","article-title":"Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata","volume":"5","author":"Ibarra","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(83)90032-6_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(83)90032-6_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(83)90032-6_BIB12","series-title":"Automata, Languages, and Programming","first-page":"506","article-title":"Alternating multihead finite automata","author":"King","year":"1981"},{"key":"10.1016\/0022-0000(83)90032-6_BIB13","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(83)90032-6_BIB14","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(83)90032-6_BIB15","first-page":"80","article-title":"Two-way multihead automata over a one-letter alphabet","volume":"14","author":"Monien","year":"1980","journal-title":"RAIRO Inform. Theor."},{"key":"10.1016\/0022-0000(83)90032-6_BIB16","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(83)90032-6_BIB17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(81)90045-4","article-title":"A hardest language recognized by two-way nondeterministic pushdown automata","volume":"13","author":"Rytter","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(83)90032-6_BIB18","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\/0022-0000(83)90032-6_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(76)90426-5","article-title":"One-way multihead writing finite automata","volume":"25","author":"Sudborough","year":"1976","journal-title":"Inform. Control"},{"key":"10.1016\/0022-0000(83)90032-6_BIB20","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":"1980","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900326?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900326?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:50:58Z","timestamp":1550307058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900326"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0022000083900326"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90032-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}