Skip to main content
SpringerLink
Log in

Efficient simulations by queue machines

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

  • 168 Accesses

Abstract

The following simulations by machines equipped with a one-way input tape and additional queue storage are shown:

  • Every single-tape Turing machine (no separate input-tape) with time bound t(n) can be simulated by one queue in O(t(n)) time.

  • Every pushdown automaton can be simulated by one queue in time O(n√n).

  • Every deterministic machine with a one-turn pushdown store can be simulated deterministically by one queue in O(n√n) time.

  • Every Turing machine with several multi-dimensional tapes accepting with time bound t(n) can be simulated by two queues in time O(t(n) log2 t(n)).

  • Every deterministic Turing machine with several linear tapes accepting with time bound t(n) can be simulated deterministically by a queue and a pushdown store in O(t(n) log t(n)) time.

The former results appear to be the first sub-quadratic simulations of other storage devices such as pushdowns or tapes by one queue. The simulations of pushdown machines almost match the corresponding lower bounds.

Research supported in part by the French-German project PROCOPE.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ronald V. Book and Sheila A. Greibach. Quasi-realtime languages. Mathematical Systems Theory, 4:97–111, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  2. Franz-Josef Brandenburg. Multiple equality sets and Post machines. Journal of Computer and System Sciences, 21:292–316, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Yu. Grigor'ev. Imbedding theorems for Turing machines of different dimensions and Kolmogorov's algorithms. Dokl. Akad. Nauk SSSR, 234:15–18, 1977. In Russian, translation in Soviet Math. Dokl., 18:588–592, 1977.

    MATH  MathSciNet  Google Scholar 

  4. D. Yu. Grigor'ev. Time complexity of multidimensional Turing machines. Zapiski Nauchnykh Seminarov Leningradskogo Otdelniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, 88:47–55, 1979. In Russian, translation in J. Soviet Mathematics, 20:2290–2295, 1982.

    MATH  MathSciNet  Google Scholar 

  5. Juris Hartmanis and Richard E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117:285–306, 1965.

    Article  MATH  MathSciNet  Google Scholar 

  6. Frederick C. Hennie. On-line Turing machine computations. IEEE Transactions on Electronic Computers, EC-15:35–44, 1966.

    Google Scholar 

  7. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading Mass., 1979.

    Google Scholar 

  8. Martin Hühne. On the power of several queues. Theoretical Computer Science, 113:75–91, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  9. Ming Li, Luc Longpré, and Paul Vitányi. The power of the queue. SIAM Journal on Computing, 21:697–712, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  10. Ming Li and Paul M. B. Vitányi. Tape versus queue and stacks: The lower bounds. Information and Computation, 78:56–85, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  11. Michael C. Loui. Simulations among multidimensional Turing machines. Theoretical Computer Science, 21:145–161, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  12. Zohar Manna. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.

    Google Scholar 

  13. Burkhard Monien. About the derivation languages of grammars and machines. In M. Steinby, editor, Proceedings of the 4th International Colloquium on Automata, Languages and Programming (ICALP), Turku, 1977, Lecture Notes in Computer Science, pages 337–351, 1977.

    Google Scholar 

  14. Nicholas Pippenger and Michael J. Fischer. Relations among complexity measures. Journal of the Association for Computing Machinery, 26:361–381, 1979.

    MATH  MathSciNet  Google Scholar 

  15. Roland Vollmar. über einen Automaten mit Pufferspeicherung (On an automaton with buffer-tape). Computing, 5:57–70, 1970. In German.

    Article  MATH  MathSciNet  Google Scholar 

  16. Klaus Wagner and Gerd Wechsung. Computational Complexity. Mathematics and its Applications. D. Reidel Publishing Company, Dordrecht, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Stuttgart, Breitwiesenstra\e 20-22, D-70565, Stuttgart, Germany

    Holger Petersen

  2. LaBRI, Université Bordeaux 1, 351 cours de la Libération, 33405, Talence Cedex, France

    John Michael Robson

Authors
  1. Holger Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Michael Robson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, H., Robson, J.M. (1998). Efficient simulations by queue machines. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055110

Download citation

  • DOI: https://doi.org/10.1007/BFb0055110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation