On the power of several queues

Automata And Formal Languages

DOI: 10.1007/BFb0020788

Part of the Lecture Notes in Computer Science book series (LNCS, volume 480)
Cite this paper as:
Schmidt M. (1991) On the power of several queues. In: Choffrut C., Jantzen M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg

Abstract

We present almost matching upper and lower time bounds for the simulation of Turing machines with many queues (resp. tapes, stacks) on Turing machines with few queues. In particular the power of two queues in comparison with other storage types is clarified, which resolves a question left open by [LLV86]. We show: Multistorage Turing machines can be simulated in time O(t(n)1+1/k) on k-queue machines. Every online simulation of k+1 queues (or of two tapes) on k queues requires time Ω(t(n)1+1/k/polylogt(n)). The lower bounds are based on Kolmogorov complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  1. 1.InformatikUniversität DortmundBRD
  2. 2.Martin Schmidt, c/o Birgit HühneEnnepetalWest Germany

Personalised recommendations