Simulation of d′-Dimensional Cellular Automata on d-Dimensional Cellular Automata

  • Christoph Scheben
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4173)

Abstract

In this paper a fast and space efficient method for simulating a d′-dimensional cellular automaton (CA) on a d-dimensional CA (d<d′) is introduced. For d′=2 and d=1 this method is optimal (under certain assumptions) with respect to time as well as space complexity. Let in this case t(n) be the time complexity and r(n) the side length of the smallest square enclosing all used cells. Then the simulation does not need more than O(r2) cells and has a running time of d′ = d+1 a version with the time and space complexity of O(t2) will be presented. Finally it will be shown, how it is possible to simulate a 2d-dimensional CA on a d-dimensional CA in a similarly efficient way.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Achilles, A.-C., Kutrib, M., Worsch, T.: On relations between arrays of processing elements of different dimensionality. In: Proc. Parcella 1996, pp. 13–20. Akademie-Verlag, Berlin (1996)Google Scholar
  2. 2.
    Poupet, V.: Simulating 3D Cellular Automata with 2D Cellular Automata. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 439–450. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Scheben, C.: Simulation von d′-dimensionalen Zellularautomaten auf d-dimensionalen Zellularautomaten, Studienarbeit, Univ. Karlsruhe (2006)Google Scholar
  4. 4.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge (2001)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christoph Scheben
    • 1
  1. 1.University of Karlsruhe (TH)Germany

Personalised recommendations