An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata

  • Christos Kapoutsis
  • Richard Královič
  • Tobias Mömke
Conference paper

DOI: 10.1007/978-3-540-74871-7_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4665)
Cite this paper as:
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

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(n2)-state sweeping LasVegas automaton, but needs 2Ω(n) states on every sweeping deterministic automaton.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Christos Kapoutsis
    • 1
  • Richard Královič
    • 1
  • Tobias Mömke
    • 1
  1. 1.Department of Computer Science, ETH Zürich 

Personalised recommendations