Abstract
A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n 2)-state sweeping LasVegas automaton, but needs 2Ω(n) states on every sweeping deterministic automaton.
Work supported by the Swiss National Science Foundation grant 200021-107327/1.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Hromkovič, J., Schnitger, G.: On the power of LasVegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation 169, 284–296 (2001)
Hromkovič, J., Schnitger, G.: On the power of LasVegas II: two-way finite automata. Theoretical Computer Science 262(1–2), 1–24 (2001)
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. 4051, pp. 144–156. Springer, Heidelberg (2006)
Macarie, I.I., Seiferas, J.I.: Strong equivalence of nondeterministic and randomized space-bounded computations (Manuscript 1997)
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the STOC, pp. 275–286 (1978)
Sipser, M.: Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences 21(2), 195–202 (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapoutsis, C., Královič, R., Mömke, T. (2007). An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. In: Hromkovič, J., Královič, R., Nunkesser, M., Widmayer, P. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2007. Lecture Notes in Computer Science, vol 4665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74871-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74871-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74870-0
Online ISBN: 978-3-540-74871-7
eBook Packages: Computer ScienceComputer Science (R0)