{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:38Z","timestamp":1725561398224},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_65","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"635-644","source":"Crossref","is-referenced-by-count":1,"title":["Some Properties of One-Pebble Turing Machines with Sublogarithmic Space"],"prefix":"10.1007","author":[{"given":"Atsuyuki","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsushi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tokio","family":"Okazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: IEEE Symp. on Switching and Automata Theory, pp. 155\u2013160 (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"65_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01271368","volume":"3","author":"B.V. Braunmuhl","year":"1993","unstructured":"Braunmuhl, B.V., Gngler, R., Rettinger, R.: The alternation hierarchy for sublogarithmic space is infinite. Comput. Complexity\u00a03, 207\u2013230 (1993)","journal-title":"Comput. Complexity"},{"issue":"1","key":"65_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J.Assoc.Comput.Mach.\u00a028(1), 114\u2013133 (1981)","journal-title":"J.Assoc.Comput.Mach."},{"key":"65_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(86)90112-X","volume":"44","author":"J.H. Chang","year":"1986","unstructured":"Chang, J.H., Ibarra, O.H., Palis, M.A., Ravikumar, B.: On pebble automata. Theoret. Comput. Sci.\u00a044, 111\u2013121 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"65_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01683273","volume":"10","author":"Z. Galil","year":"1977","unstructured":"Galil, Z.: Some open problems in the theory of computation as questions about two-way deterministic pushdown automata languages. Math. Systems Theory\u00a010, 211\u2013228 (1977)","journal-title":"Math. Systems Theory"},{"key":"65_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"issue":"5","key":"65_CR7","first-page":"999","volume":"E82-D","author":"T. Okazaki","year":"1999","unstructured":"Okazaki, T., Zhang, L., Inoue, K., Ito, A., Wang, Y.: A relationship between two-way deterministic one-counter automata and one-pebble deterministi Turing machines with sublogarithmic space. IEICE Trans. INF. & SYST.\u00a0E82-D(5), 999\u20131004 (1999)","journal-title":"IEICE Trans. INF. & SYST."},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58355-6","volume-title":"Turing machines with sublogarithmic space","author":"A. Szepietowski","year":"1994","unstructured":"Szepietowski, A.: Turing Machines with Sublogarithmic Space. LNCS, vol.\u00a0843. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_65","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:17:05Z","timestamp":1552835825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}