{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:48Z","timestamp":1725493488160},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664086"},{"type":"electronic","value":"9783540483403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_22","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:04:52Z","timestamp":1184605492000},"page":"241-250","source":"Crossref","is-referenced-by-count":2,"title":["Fooling Rebound Automata"],"prefix":"10.1007","author":[{"given":"Holger","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"M. Blum and C. Hewitt. Automata on a 2-dimensional tape. In Proceedings of the 8th Annual Symposium on Switching and Automata Theory, Austin, 1967, pages 155\u2013160, 1967.","DOI":"10.1109\/FOCS.1967.6"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(82)90087-1","volume":"21","author":"P. \u010euri\u0161","year":"1982","unstructured":"P. \u010euri\u0161 and Z. Galil. Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Theoretical Computer Science, 21:39\u201353, 1982.","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BFb0029950","volume-title":"Proceedings of the 22nd Symposium on Mathematical Foundations of Computer Science (MFCS), Bratislava, 1997","author":"J. Hromkovi\u010d","year":"1997","unstructured":"J. Hromkovi\u010d and G. Schnitger. Communication complexity and sequential computation. In I. Pr\u00edvara and P. Ru\u017ei\u010dka, editors, Proceedings of the 22nd Symposium on Mathematical Foundations of Computer Science (MFCS), Bratislava, 1997, number 1295 in Lecture Notes in Computer Science, pages 71\u201384, Berlin-Heidelberg-New York, 1997. Springer."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0255(91)90008-I","volume":"55","author":"K. Inoue","year":"1991","unstructured":"K. Inoue and I. Takanami. A survey of two-dimensional automata theory. Information Sciences, 55:99\u2013121, 1991.","journal-title":"Information Sciences"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. L. Minsky","year":"1961","unstructured":"M. L. Minsky. Recursive unsolvability of Post\u2019s problem of \u201ctag\u201d and other topics in theory of Turing machines. Annals of Mathematics, 74:437\u2013455, 1961.","journal-title":"Annals of Mathematics"},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita\/1980140100671","volume":"14","author":"B. Monien","year":"1980","unstructured":"B. Monien. Two-way multihead automata over a one-letter alphabet. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 14:67\u201382, 1980.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"22_CR7","first-page":"80","volume":"8","author":"K. Morita","year":"1977","unstructured":"K. Morita, K. Sugata, and H. Umeo. Computation complexity of n-bounded counter automaton and multidimensional rebound automaton. Systems \u2022 Computers \u2022 Controls, 8:80\u201387, 1977. Translated from Denshi Tsushin Gakkai Ronbunshi (IECE of Japan Trans.) 60-D:283\u2013290, 1977 (Japanese).","journal-title":"Systems \u2022 Computers \u2022 Controls"},{"key":"22_CR8","first-page":"226","volume":"60-E","author":"K. Morita","year":"1977","unstructured":"K. Morita, K. Sugata, and H. Umeo. Computational complexity of n-bounded counter automaton and multi-dimensional rebound automaton. IECE of Japan Trans., 60-E:226\u2013227, 1977. Abstract of [7].","journal-title":"IECE of Japan Trans."},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/193820.193835","volume":"25","author":"H. Petersen","year":"1994","unstructured":"H. Petersen. Two-way one-counter automata accepting bounded languages. SIGACT News, 25(3):102\u2013105, 1994.","journal-title":"SIGACT News"},{"key":"22_CR10","first-page":"879","volume":"73-E","author":"M. Sakamoto","year":"1990","unstructured":"M. Sakamoto, K. Inoue, and I. Takanami. A two-way nondeterministic one-counter language not accepted by nondeterministic rebound automata. IECE of Japan Trans., 73-E:879\u2013881, 1990.","journal-title":"IECE of Japan Trans."},{"key":"22_CR11","first-page":"11","volume":"60-A","author":"K. Sugata","year":"1977","unstructured":"K. Sugata, H. Umeo, and K. Morita. The language accepted by a rebound automaton and its computing ability. Electronics and Communications in Japan, 60-A:11\u201318, 1977.","journal-title":"Electronics and Communications in Japan"},{"key":"22_CR12","first-page":"25","volume":"COMP98-4","author":"L. Zhang","year":"1998","unstructured":"L. Zhang, J. Xu, K. Inoue, A. Ito, and Y. Wang. Alternating rebound Turing machines. Technical Report of IEICE, COMP98-4:25\u201332, 1998.","journal-title":"Technical Report of IEICE"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T03:41:08Z","timestamp":1550461268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}