Advertisement

Stacks versus Deques

  • Holger Petersen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2108)

Abstract

We investigate the relative efficiency of a finite number of stacks in comparison to several variants of deques. In the nondeterministic setting, two stacks can simulate a general deque in linear time. This implies a negative answer to the question raised by Brandenburg whether a deque can simulate a finite number of tapes in linear time. Wealso show that in realtime an output-restricted deque cannot simulate two stacks for deterministic computations. It is known that a general deque can be simulated deterministically by three stacks in linear time. We describe an approach that is simpler to analyze and has a smaller constant factor (with respect to the required stack operations) than a previous solution.

Keywords

Linear Time Computing Machinery Green Item Deterministic Machine Push Operation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kathleen Ayers Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages. Theoretical Computer Science, 40:163–174, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ronald V. Book and Sheila A. Greibach Quasi-realtime languages. Mathematical Systems Theory, 4:97–111, 1970.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Franz J. Brandenburg A note on:’ Deque automata and a subfamily of contextsensitive languages which contains all semilinear bounded languages’ (by K. Ayers). Theoretical Computer Science, 52:341–342, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Tyng-Ruey Chuang and Benjamin Goldberg Real-time deques, multihead Turing machines, and purely functional programming. In Conference on Functional Programming Languages and Computer Architecture, pages 289–298, 1993.Google Scholar
  5. 5.
    Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg Real-time simulation of multihead tape units. Journal of the Association for Computing Machinery, 19:590–607, 1972.zbMATHMathSciNetGoogle Scholar
  6. 6.
    Zvi Galil, Ravi Kannan, and Endre Szemeredi On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines. In Proceedings of the 18th ACM Symposium on Theory of Computing (STOC), Berkeley, California, pages 39–49, 1986.Google Scholar
  7. 7.
    Juris Hartmanis and Richard E. Stearns On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117:285–306, 1965.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Robert Hood and Robert Melville Real time queue operations in pure Lisp. Information Processing Letters, 13:50–54, 1981.CrossRefGoogle Scholar
  9. 9.
    Tao Jiang, Joel I. Seiferas, and Paul M. B. Vit#x00E1;nyi Two heads are better than two tapes. Journal of the Association for Computing Machinery, 44:237–256, 1997.zbMATHGoogle Scholar
  10. 10.
    Donald E. Knuth The Art of Computer Programming, volume 1. Addison-Wesley, Reading Mass., 3rd edition, 1997.Google Scholar
  11. 11.
    Benton L. Leong and Joel I. Seiferas New real-time simulations of multihead tape units. Journal of the Association for Computing Machinery, 28:166–180, 1981.zbMATHMathSciNetGoogle Scholar
  12. 12.
    Ming Li Simulating two pushdown stores by one tape in O(n1.5vlog n) time. Journal of Computer and System Sciences, 37:101–116, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Ming Li, Luc Longpré, and Paul Vitányi The power of the queue. SIAM Journal on Computing, 21:697–712, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Ming Li and Paul Vitányi An Introduction to Kolmogorov Complexity and its Applications. Springer, Berlin-Heidelberg-New York, 1993.zbMATHGoogle Scholar
  15. 15.
    Ming Li and Paul M. B. Vitányi Tape versus queue and stacks: The lower bounds. Information and Computation, 78:56–85, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Burton Rosenberg Simulating a stack by queues. In Proceedings of the XIX Latinamerican Conference on Computer Science, volume 1, pages 3–13, 1993.Google Scholar
  17. 17.
    Hanns-Jörg Stoß k-Band Simulation von k-Kopf Turingmaschinen. (k-tape simulation of k-head Turing machines). Computing, 6:309–317, 1970. In German.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Holger Petersen
    • 1
  1. 1.Institute of Computer ScienceUniversity of StuttgartBreitwiesenstrStuttgart

Personalised recommendations