{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:48:15Z","timestamp":1648799295668},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,10]]},"abstract":"<jats:p> This paper continues the investigation of rebound Turing machines (RTM's). We first investigate a relationship between the accepting powers of simple one-way 2-head finite automata and simultaneously space-bounded and leaf-size bounded alternating RTM's, and show that for any functions L(n) and Z(n) such that L(n)Z(n)=o( log n) and [Formula: see text], simple one-way 2-head finite automata are incomparable with simultaneously L(n) space-bounded and Z(n) leaf-size bounded alternating RTM's. We then investigate a relationship between Las Vegas and determinism for space-bounded RTM's, and show that there is a language accepted by a Las Vegas rebound automaton, but not accepted by any weakly o( log log n) space-bounded deterministic RTM. This is the first separation result between Las Vegas and determinism for space-bounded computing models over strings. <\/jats:p>","DOI":"10.1142\/s0129054104002753","type":"journal-article","created":{"date-parts":[[2004,10,22]],"date-time":"2004-10-22T07:32:49Z","timestamp":1098430369000},"page":"791-807","source":"Crossref","is-referenced-by-count":0,"title":["A NOTE ON REBOUND TURING MACHINES"],"prefix":"10.1142","volume":"15","author":[{"given":"KATSUSHI","family":"INOUE","sequence":"first","affiliation":[{"name":"Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University, Ube-shi, 755-8611, Japan"}]},{"given":"AKIRA","family":"ITO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University, Ube-shi, 755-8611, Japan"}]},{"given":"TAKASHI","family":"KAMIURA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and System Engineering, Faculty of Engineering, Yamaguchi University, Ube-shi, 755-8611, Japan"}]},{"given":"HOLGER","family":"PETERSEN","sequence":"additional","affiliation":[{"name":"Institut fur Formale Methoden, Universitat Stuttgart, Stuttgart, Germany"}]},{"given":"LAN","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Toshiba Corporation e-Solutions Company, System Integration Technology Center, Katamachi, Fuchu-shi, Tokyo, 183-8512, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","unstructured":"M.\u00a0Blum and C.\u00a0Hewitt, IEEE Symp. on Switching and Automata Theory (1967)\u00a0pp. 155\u2013160."},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"rf4","volume-title":"Introduction to automata theory, languages and computation","author":"Hopcroft J. D.","year":"1979"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80026-8"},{"key":"rf6","first-page":"758","volume":"60","author":"Inoue K.","journal-title":"Trans. IECE'77"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90040-6"},{"key":"rf8","first-page":"111","volume":"61","author":"Inoue K.","journal-title":"Trans. IECE'78"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90033-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(82)90045-7"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90093-2"},{"key":"rf12","first-page":"1094","volume":"84","author":"Inoue K.","journal-title":"IEICE TRANS. FUNDAMENTALS"},{"key":"rf13","first-page":"241","volume":"1672","author":"Petersen H.","journal-title":"Proceedings of the 24th Symposium on Mathematical Foundations of Computer Science (MFCS)"},{"key":"rf14","first-page":"589","volume":"1893","author":"Petersen H.","journal-title":"Proceedings of the 25th Symposium on Mathematical Foundations of Computer Science (MFCS)"},{"key":"rf15","volume-title":"Picture Languages (Formal Models for Picture Recognition)","author":"Rosenfeld A.","year":"1979"},{"key":"rf16","first-page":"879","volume":"73","author":"Sakamoto M.","journal-title":"The Trans. of the IEICE"},{"key":"rf17","first-page":"367","author":"Sugata K.","journal-title":"IECE of Japan, Trans. (A)"},{"key":"rf18","first-page":"395","volume":"7","author":"Zhang L.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf19","first-page":"745","volume":"82","author":"Zhang L.","journal-title":"IEICE TRANS. FUNDAMENTALS"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:39:45Z","timestamp":1565123985000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":18,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,10]]}},"alternative-id":["10.1142\/S0129054104002753"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002753","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}