{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:04Z","timestamp":1725490384033},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748700"},{"type":"electronic","value":"9783540748717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74871-7_12","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:52:35Z","timestamp":1188301955000},"page":"130-141","source":"Crossref","is-referenced-by-count":4,"title":["An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata"],"prefix":"10.1007","author":[{"given":"Christos","family":"Kapoutsis","sequence":"first","affiliation":[]},{"given":"Richard","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"M\u00f6mke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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 LasVegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation\u00a0169, 284\u2013296 (2001)","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00155-9","volume":"262","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d, J., Schnitger, G.: On the power of LasVegas II: two-way finite automata. Theoretical Computer Science\u00a0262(1\u20132), 1\u201324 (2001)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","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.A. Kapoutsis","year":"2006","unstructured":"Kapoutsis, C.A.: 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)"},{"key":"12_CR4","unstructured":"Macarie, I.I., Seiferas, J.I.: Strong equivalence of nondeterministic and randomized space-bounded computations (Manuscript 1997)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the STOC, pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"issue":"2","key":"12_CR6","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","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74871-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:43:39Z","timestamp":1619520219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74871-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748700","9783540748717"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74871-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}