A Spectral Portrait of the Elementary Cellular Automata Rule Space
Fourier spectra of cellular automata rules give a quantitative characterisation of the frequency of bit patterns present in the limit configurations generated out of their time evolution. By means of the similarity among the spectrum of each rule, the elementary cellular automata rule space is partitioned, both for periodic and non-periodic boundary conditions, thus giving rise to rule classes of spectral equivalence. The partitions generated are formally explained in terms of the dynamical behaviour of the rules, and maps of the elementary space are given in terms of graphs that represent the spectral similarity among the rules, thus displaying a spectral portrait of how the classes relate to each other.
KeywordsFourier spectrum discrete Fourier transform elementary cellular automata discrete dynamical systems dynamical behaviour of cellular automata
Unable to display preview. Download preview PDF.
- 9.Ruivo, E.L.P., de Oliveira, P.P.B.: Spectral similarity among elementary cellular automata. In: Formenti, E. (ed.) Proc. of AUTOMATA 2012: 18th Int. Workshop on Cellular Automata and Discrete Complex Systems, pp. 89–98 (2012)Google Scholar
- 10.Shranko, A., de Oliveira, P.P.B.: Relationships between local dynamics and global reversibility of multidimensional cellular automata with hyper-rectangular neighbourhoods (unpublished manuscript)Google Scholar
- 13.Wolfram, S.: A New Kind of Science. Wolfram Media (2002)Google Scholar
- 16.Zwick, M., Shu, H.: Set-theoretic reconstructability of elementary cellular automata. General Systems 1, 1–6 (1995)Google Scholar