{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:53:50Z","timestamp":1757627630494,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,4,2]],"date-time":"2004-04-02T00:00:00Z","timestamp":1080864000000},"content-version":"vor","delay-in-days":5024,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0304-3975(90)90178-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"265-278","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["The difference between one tape and two tapes: With respect to reversal complexity"],"prefix":"10.1016","volume":"73","author":[{"given":"Jian-er","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90178-K_BIB1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90178-K_BIB2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PSCT.1987.10319249","article-title":"Reversal complexity","author":"Chen","year":"1987","journal-title":"Proc. 2nd Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0304-3975(90)90178-K_BIB3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(68)80028-5","article-title":"The reduction of tape reversal for off-line one-tape Turing machines","volume":"2","author":"Fisher","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90178-K_BIB4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(68)80027-3","article-title":"Tape-reversal bounded Turing machine computations","volume":"2","author":"Hartmanis","year":"1968","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90178-K_BIB5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/S0019-9958(65)90399-2","article-title":"One-tape, off-line Turing machine computations","volume":"8","author":"Hennie","year":"1965","journal-title":"Inform. and Control"},{"year":"1980","series-title":"On similarity and duality of computation","author":"Hong","key":"10.1016\/0304-3975(90)90178-K_BIB6"},{"key":"10.1016\/0304-3975(90)90178-K_BIB7","series-title":"Technical Report #552","article-title":"Nondeterministic space is closed under complement","author":"Immerman","year":"1987"},{"key":"10.1016\/0304-3975(90)90178-K_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90178-K_BIB9","series-title":"Ph.D. Thesis","article-title":"On some subrecursive reducibilities","author":"Simon","year":"1977"},{"year":"1988","series-title":"Introduction to the Theory of Complexity Classes","author":"Yap","key":"10.1016\/0304-3975(90)90178-K_BIB10"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090178K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090178K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:34Z","timestamp":1757477914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090178K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["030439759090178K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90178-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1990,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The difference between one tape and two tapes: With respect to reversal complexity","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90178-K","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}