Skip to main content
SpringerLink
Log in

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata

  • Conference paper
Stochastic Algorithms: Foundations and Applications (SAGA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4665))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hromkovič, J., Schnitger, G.: On the power of LasVegas II: two-way finite automata. Theoretical Computer Science 262(1–2), 1–24 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. Macarie, I.I., Seiferas, J.I.: Strong equivalence of nondeterministic and randomized space-bounded computations (Manuscript 1997)

    Google Scholar 

  5. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the STOC, pp. 275–286 (1978)

    Google Scholar 

  6. Sipser, M.: Lower bounds on the size of sweeping automata. Journal of Computer and System Sciences 21(2), 195–202 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, ETH Zürich,  

    Christos Kapoutsis, Richard Královič & Tobias Mömke

Authors
  1. Christos Kapoutsis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Královič
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tobias Mömke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Juraj Hromkovič Richard Královič Marc Nunkesser Peter Widmayer

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation