Stacks versus Deques

Authors:
Holger Petersen
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 12
Cited 0

Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages

Theoretical Computer Science
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A note on: 'Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers)

Theoretical Computer Science
Tape versus queue and stacks: the lower bounds

Information and Computation
Simulating two pushdown stores by one tape in O(n1.5√log n) time

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
The power of the queue

SIAM Journal on Computing
An introduction to Kolmogorov complexity and its applications

An introduction to Kolmogorov complexity and its applications
Real-time deques, multihead Turing machines, and purely functional programming

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Two heads are better than two tapes

Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)
New Real-Time Simulations of Multihead Tape Units

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.