Stacks versus Deques
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 10.Donald E. Knuth The Art of Computer Programming, volume 1. Addison-Wesley, Reading Mass., 3rd edition, 1997.Google Scholar
- 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