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.

[1]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[2]  Kathleen Ayers.  Deque Automata and a Subfamily of Context-Sensitive Languages which Contains all Semilinear Bounded Languages , 1985, Theor. Comput. Sci..

[3]  Luc Longpré,et al.  The Power of the Queue , 1992, SIAM J. Comput..

[4]  Arnold L. Rosenberg,et al.  Real-Time Simulation of Multihead Tape Units , 1972, JACM.

[5]  Robert HOOD,et al.  Real-Time Queue Operation in Pure LISP , 1980, Inf. Process. Lett..

[6]  Joel I. Seiferas,et al.  New Real-Time Simulations of Multihead Tape Units , 1981, J. ACM.

[7]  Ming Li,et al.  Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..

[8]  Ming Li,et al.  Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time , 1988, J. Comput. Syst. Sci..

[9]  Ming Li,et al.  Simulating two pushdown stores by one tape in O(n1.5v) time , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Benjamin Goldberg,et al.  Real-time deques, multihead Turing machines, and purely functional programming , 1993, FPCA '93.

[11]  Franz-Josef Brandenburg.  A Note on: 'Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages' , 1987, Theor. Comput. Sci..

[12]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[13]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[14]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[15]  Endre Szemerédi,et al.  On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.