Abstract
The purpose of this article is to describe a way to simulate any 3-dimensional cellular automaton with a 2-dimensional cellular automaton. We will present the problems that arise when changing the dimension, propose solutions and discuss the main properties of the obtained simulation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frisch, U., d’Humières, D., Hasslacher, B., Lallemand, P., Pomeau, Y., Rivet, J.P.: Lattice gas hydrodynamics in two and three dimension. Complex Systems 1, 649–707 (1987) Reprinted in Doolen, G. (ed.) Lattice Gas Methods for Partial Differential Equations, p.77, Addison-Wesley (1990)
Róka, Z.: Simulations between cellular automata on Cayley graphs. Theoretical Computer Science 225, 81–111 (1999)
Martin, B.: A geometrical hierarchy on graphs via cellular automata. Fundamenta Informaticae 52, 157–181 (2002)
Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Transactions on Computers C-18, 349–365 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poupet, V. (2004). Simulating 3D Cellular Automata with 2D Cellular Automata. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive