{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:07Z","timestamp":1760202487919},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90142-2","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"267-280","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Two-way automata with more than one storage medium"],"prefix":"10.1016","volume":"39","author":[{"given":"J\u00f6rg","family":"Vogel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90142-2_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(85)90142-2_BIB2","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(85)90142-2_BIB3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fischer","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(85)90142-2_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","article-title":"Two-way pushdown automata","volume":"11","author":"Gray","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(85)90142-2_BIB5","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/S0022-0000(67)80013-8","article-title":"Nonerasing stack automata","volume":"1","author":"Hopcroft","year":"1967","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90142-2_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0022-0000(71)80029-6","article-title":"Characterizations of some tapes 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\/0304-3975(85)90142-2_BIB7","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018Tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(85)90142-2_BIB8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","article-title":"Classes of predictably computable functions","volume":"106","author":"Ritchie","year":"1963","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901422?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901422?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:51Z","timestamp":1553172771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":8,"alternative-id":["0304397585901422"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90142-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}