{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T17:20:22Z","timestamp":1769880022934,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642027369","type":"print"},{"value":"9783642027376","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_4","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T08:40:30Z","timestamp":1246351230000},"page":"47-66","source":"Crossref","is-referenced-by-count":25,"title":["Size Complexity of Two-Way Finite Automata"],"prefix":"10.1007","author":[{"given":"Christos A.","family":"Kapoutsis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_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":"4_CR2","unstructured":"Birget, J.-C.: Two-way automata and length-preserving homomorphisms. Report 109, Department of Computer Science, University of Nebraska (1990)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01371727","volume":"26","author":"J.-C. Birget","year":"1993","unstructured":"Birget, J.-C.: State-complexity of finite-state devices, state compressibility and incompressibility. Mathematical Systems Theory\u00a026, 237\u2013269 (1993)","journal-title":"Mathematical Systems Theory"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science\u00a047, 149\u2013158 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Stockmeyer, L.J.: A time complexity gap for two-way probabilistic finite-state automata. SIAM Journal of Computing\u00a019(6), 1011\u20131023 (1990)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.J.: Finite state verifiers I: The power of interaction. Journal of the ACM\u00a039(4), 800\u2013828 (1992)","journal-title":"Journal of the ACM"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Freivalds, R.: Probabilistic two-way machines. In: Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pp. 33\u201345 (1981)","DOI":"10.1007\/3-540-10856-4_72"},{"key":"4_CR8","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"},{"issue":"8","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.ic.2007.01.008","volume":"205","author":"V. Geffert","year":"2007","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Information and Computation\u00a0205(8), 1173\u20131187 (2007)","journal-title":"Information and Computation"},{"issue":"2","key":"4_CR10","first-page":"193","volume":"8","author":"J. Goldstine","year":"2002","unstructured":"Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. Journal of Universal Computer Science\u00a08(2), 193\u2013234 (2002)","journal-title":"Journal of Universal Computer Science"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1006\/inco.2001.3040","volume":"169","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation\u00a0169, 284\u2013296 (2001)","journal-title":"Information and Computation"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Schnitger, G.: Nondeterminism versus determinism for two-way finite automata: generalizations of Sipser\u2019s separation. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, pp. 439\u2013451 (2003)","DOI":"10.1007\/3-540-45061-0_36"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.: Small sweeping 2NFAs are not closed under complement. In: Proceedings of the International Colloquium on Automata, Languages, and Programming, pp. 144\u2013156 (2006)","DOI":"10.1007\/11786986_14"},{"issue":"1-2","key":"4_CR14","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":"4_CR15","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: An exponential gap between Las Vegas and deterministic sweeping finite automata. In: Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications, pp. 130\u2013141 (2007)","DOI":"10.1007\/978-3-540-74871-7_12"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C., Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: On the size complexity of rotating and sweeping automata. In: Proceedings of the International Conference on Developments in Language Theory, pp. 455\u2013466 (2008)","DOI":"10.1007\/978-3-540-85780-8_36"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kr\u00e1lovi\u010d, R.: Infinite vs. finite space-bounded randomized computations. In: Proceedings of the IEEE Conference on Computational Complexity (to appear, 2009)","DOI":"10.1109\/CCC.2009.10"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R.E. Ladner","year":"1984","unstructured":"Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM Journal of Computing\u00a013(1), 135\u2013155 (1984)","journal-title":"SIAM Journal of Computing"},{"issue":"3\u20134","key":"4_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0020-0190(99)00129-5","volume":"72","author":"I.I. Macarie","year":"1999","unstructured":"Macarie, I.I., Seiferas, J.I.: Amplification of slight probabilistic advantage at absolutely no cost in space. Information Processing Letters\u00a072(3\u20134), 113\u2013118 (1999)","journal-title":"Information Processing Letters"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: Proceedings of the Symposium on Switching and Automata Theory, pp. 188\u2013191 (1971)","DOI":"10.1109\/SWAT.1971.11"},{"key":"4_CR21","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading (1994)"},{"key":"4_CR22","unstructured":"Rabin, M.O.: Two-way finite automata. In: Proceedings of the Summer Institute of Symbolic Logic, Cornell, pp. 366\u2013369 (1957)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the Symposium on the Theory of Computing, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"4_CR25","unstructured":"Seiferas, J.I.: Untitled manuscript. Communicated to M.\u00a0Sipser (October 1973)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1147\/rd.32.0198","volume":"3","author":"J.C. Shepherdson","year":"1959","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM Journal of Research and Development\u00a03, 198\u2013200 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M. Sipser","year":"1980","unstructured":"Sipser, M.: Halting space-bounded computations. Theoretical Computer Science\u00a010, 335\u2013338 (1980)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR28","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"},{"key":"4_CR29","volume-title":"Introduction to the theory of computation","author":"M. Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company, Boston (1996)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:25:18Z","timestamp":1558398318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}