Skip to main content
SpringerLink
Log in

Efficient Universal Pushdown Cellular Automata and Their Application to Complexity

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2001)

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

Included in the following conference series:

Abstract

In order to obtain universal classical cellular automata infinite space is required. Therefore, the number of required processors depends on the length of input data and, additionally, may increase during the computation. On the other hand, Turing machines are universal devices which have one processor only and additionally an infinite storage tape. Here an in some sense intermediate model is studied. The pushdown cellular automata are a stack augmented generalization of classical cellular automata. They form a massively parallel universal model where the number of processors is bounded by the length of input data. Efficient universal pushdown cellular automata and their efficiently verifiable encodings are proposed. They are applied to computational complexity, and tight time and stack-space hierarchies are shown.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert and Čulik II, K. A simple universal cellular automaton and its one-way and totalistic version. Complex Systems 1 (1987), 1–16.

    MATH  Google Scholar 

  2. Buchholz, Th. and Kutrib, M. Some relations between massively parallel arrays. Parallel Comput. 23 (1997), 1643–1662.

    Article  MathSciNet  Google Scholar 

  3. Buchholz, Th. and Kutrib, M. tiOn time computability of functions in one-way cellular automata. Acta Inf. 35 (1998), 329–352.

    Article  MATH  MathSciNet  Google Scholar 

  4. Harrison, M. A. Introduction to Formal Language Theory. Addison-Wesley, Reading, 1978.

    Google Scholar 

  5. Imai, K. and Morita, K. A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret. Comput. Sci. 231 (2000), 181–191.

    Article  MATH  MathSciNet  Google Scholar 

  6. Iwamoto, C., Hatsuyama, T., Morita, K., and Imai, K. On time-constructible functions in one-dimensional cellular automata. Fundamentals of Computation Theory 1999, LNCS 1684, 1999, pp. 317-326.

    Chapter  Google Scholar 

  7. Kutrib, M. Pushdown cellular automata. Theoret. Comput. Sci. 215 (1999), 239–261.

    Article  MATH  MathSciNet  Google Scholar 

  8. Kutrib, M. Efficient Universal Pushdown Cellular Automata and their Application to Complexity. IFIG Research Report 0004, Institute of Informatics, University of Giessen, Giessen, 2000.

    Google Scholar 

  9. Kutrib, M. and Richstein, J. Real-time one-way pushdown cellular automata languages. Developments in Language Theory II. At the Crossroads of Mathematics, Computer Science and Biology, World Scientific, Singapore, 1996, pp. 420–429.

    Google Scholar 

  10. Margenstern, M. Frontier between decidability and undecidability: a survey. Theoret. Comput. Sci. 231 (2000), 217–251.

    Article  MATH  MathSciNet  Google Scholar 

  11. Martin, B. Efficient unidimensional universal cellular automaton. Mathematical Foundations of Computer Science 1992, LNCS 629, 1992, pp. 374–382.

    Google Scholar 

  12. Martin, B. A universal cellular automaton in quasi-linear time and its S-m-n form. Theoret. Comput. Sci. 123 (1994), 199–237.

    Article  MATH  MathSciNet  Google Scholar 

  13. Mazoyer, J. and Terrier, V. Signals in one dimensional cellular automata. Theoret. Comput. Sci. 217 (1999), 53–80.

    Article  MATH  MathSciNet  Google Scholar 

  14. Morita, K. Computation-universality of one-dimensional one-way reversible cellular automata. Inform. Process. Lett. 42 (1992), 325–329.

    Article  MATH  MathSciNet  Google Scholar 

  15. Morita, K. and Ueno, S. Computation-universal models of two-dimensional 16-state reversible cellular automata. Trans. IEICE 75 (1992), 141.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Giessen, Arndtstr. 2, D-35392, Giessen, Germany

    Martin Kutrib

Authors
  1. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LITA, UFR MIM, Université de Metz, Ile du Saulcy, 57045, Metz, Cedex, France

    Maurice Margenstern

  2. Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova, 5 Academiei str, 2028, Chiŗinău, Moldova

    Yurii Rogozhin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kutrib, M. (2001). Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. In: Margenstern, M., Rogozhin, Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45132-3_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45132-3_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42121-4

  • Online ISBN: 978-3-540-45132-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation