Abstract
A novel algebraic and dynamic systems approach to finite elementary cellular automata is presented. In particular, simple algebraic expressions for the local rules of elementary cellular automata are deduced and the cellular automata configurations are represented via Fourier analysis. This allows for a further analysis of the global dynamics of cellular automata by the use of tools derived from functional analysis and dynamical system theory. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Schüle, M., Ott, T., & Stoop, R. (2008). Global dynamics of finite cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5163 LNCS, pp. 71–78). https://doi.org/10.1007/978-3-540-87536-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
