{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:48Z","timestamp":1725663588507},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_73","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:26Z","timestamp":1330257326000},"page":"203-214","source":"Crossref","is-referenced-by-count":0,"title":["Reversal-space trade-offs for simultaneous resource-bounded nondeterministic Turing machines"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Yamamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. S. Baker","year":"1974","unstructured":"B.S. Baker and R.V. Book: \u201cReversal bounded multipushdown machines\u201d, J. Comput. System. Sci., 8, 315\u2013322(1974).","journal-title":"J. Comput. System. Sci."},{"key":"17_CR2","first-page":"99","volume":"XXVII","author":"S. A. Cook","year":"1981","unstructured":"S.A.Cook: \u201cTowards a complexity theory of synchronous parallel computation\u201d, L Enseignement mathematique, T. XXVII, fasc.1\u20132, 99\u2013124(1981).","journal-title":"L Enseignement mathematique"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(68)80028-5","volume":"2","author":"P. C. Fischer","year":"1968","unstructured":"P.C. Fischer: \u201cThe reduction of tape reversals for off-line one tape Turing machines\u201d, J. Comput. Syst. Sci., 2, 136\u2013147(1968).","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0019-9958(78)90289-9","volume":"36","author":"S. A. Greibach","year":"1978","unstructured":"S.A. Greibach: \u201cVisits, crosses and reversals for off-line one-tape Turing machines\u201d, Inform. and Control, 36, 174\u2013216 (1978).","journal-title":"Inform. and Control"},{"key":"17_CR5","volume-title":"Introduction to automata theory language and computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman: \u201cIntroduction to automata theory language and computation\u201d, Addison Wesley, Reading Mass, 1979."},{"issue":"2\/3","key":"17_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0019-9958(86)80003-1","volume":"70","author":"E. Moriya","year":"1986","unstructured":"E. Moriya, S. Iwata and T. Kasai: \u201cA Note on Some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machine\u201d, Information and Control, 70, 2\/3, 179\u2013185(1986).","journal-title":"Information and Control"},{"key":"17_CR7","unstructured":"N. Pipenger: \u201cOn simultaneous resource bounds\u201d, Proc. 20th Annu. Found. of Comput. Sci., 307\u2013311(1979)."},{"issue":"1","key":"17_CR8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/322047.322061","volume":"25","author":"J. I. Seiferas","year":"1978","unstructured":"J.I. Seiferas, M. J. Fischer and A.R. Meyer: \u201cSeparating nondeterministic time complexity classes\u201d, J. Assoc. Comput. Mach., 25, 1, 146\u2013167(1978).","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"17_CR9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(87)90055-1","volume":"75","author":"H. Yamamoto","year":"1987","unstructured":"H. Yamamoto and S. Noguchi: \u201cComparison of the power between reversal bounded ATMs and reversal bounded NTMs\u201d, Information and Computation, 75, 2, 144\u2013161(1987).","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:38Z","timestamp":1619571458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}