{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:17:01Z","timestamp":1742923021584,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_15","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T03:29:39Z","timestamp":1308367779000},"page":"198-209","source":"Crossref","is-referenced-by-count":3,"title":["Nondeterminism Is Essential in Small 2FAs with Few Reversals"],"prefix":"10.1007","author":[{"given":"Christos A.","family":"Kapoutsis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Report 304, Institute of Computer Science, Polish Academy of Sciences, Warsaw (1977)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","volume":"295","author":"V. Geffert","year":"2003","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theoretical Computer Science\u00a0295, 189\u2013203 (2003)","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-14455-4_19","volume-title":"Developments in Language Theory","author":"V. Geffert","year":"2010","unstructured":"Geffert, V., Pighizzini, G.: Two-way unary automata versus logarithmic space. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 197\u2013208. Springer, Heidelberg (2010)"},{"issue":"4","key":"15_CR4","first-page":"519","volume":"7","author":"J. Hromkovi\u010d","year":"2002","unstructured":"Hromkovi\u010d, J.: Descriptional complexity of finite automata: concepts and open problems. Journal of Automata, Languages and Combinatorics\u00a07(4), 519\u2013531 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-45061-0_36","volume-title":"Automata, Languages and Programming","author":"J. Hromkovi\u010d","year":"2003","unstructured":"Hromkovi\u010d, J., Schnitger, G.: Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser\u2019s separation. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 439\u2013451. Springer, Heidelberg (2003)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11786986_14","volume-title":"Automata, Languages and Programming","author":"C. Kapoutsis","year":"2006","unstructured":"Kapoutsis, C.: Small sweeping 2NFAs are not closed under complement. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 144\u2013156. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"15_CR7","first-page":"215","volume":"12","author":"C. Kapoutsis","year":"2007","unstructured":"Kapoutsis, C.: Deterministic moles cannot solve liveness. Journal of Automata, Languages and Combinatorics\u00a012(1-2), 215\u2013235 (2007)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.: Two-way automata versus logarithmic space. In: Proceedings of Computer Science in Russia, pp. 359\u2013372 (2011)","DOI":"10.1007\/978-3-642-20712-9_28"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1006\/jcss.2001.1783","volume":"63","author":"H. Leung","year":"2001","unstructured":"Leung, H.: Tight lower bounds on the size of sweeping automata. Journal of Computer and System Sciences\u00a063(3), 384\u2013393 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR10","first-page":"275","volume-title":"Proceedings of the 10th Annual ACM Symposium on Theory of Computing","author":"W.J. Sakoda","year":"1978","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, pp. 275\u2013286. ACM, San Diego (1978)"},{"key":"15_CR11","unstructured":"Seiferas, J.I.: Untitled manuscript, communicated to M.\u00a0Sipser (October 1973)"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(80)90034-3","volume":"21","author":"M. Sipser","year":"1980","unstructured":"Sipser, M.: Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences\u00a021(2), 195\u2013202 (1980)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:11:53Z","timestamp":1553811113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}