On the Structure of Linear Cellular Automata
We introduce a new class of cellular automata, much richer than the classical one. These one dimensional cellular automata, called here linear, are presented together with their properties in the first section of the paper. We characterize linear functions which are global transition functions for certain bounded linear cellular automata. Finally, some results concerning the limit sets and a remarkable structure for isometric linear cellular automata are also included.
Unable to display preview. Download preview PDF.
- [BSL]Bandini, S., Serra, R., Liverani, F.S. (Eds): Cellular Automata: Research Towards Industry. ACRI’98 - Proceedings of the 3rd Conference on Cellular Automata for Research and Industry. Trieste. 7–9 October (1998). SpringerGoogle Scholar
- [DF]Duff, M.J.B., Fountain, T.J.: Cellular Logic Image Processing. Academic Press (1986)Google Scholar
- [DM]Durand, B., Mazoyer, J.: Growing Patterns in 1D Cellular Automata. Lecture Notes in Computer Science. (1994) 211–220Google Scholar
- [vNe]von Neumann, J.: Theory of self-reproducing automata. Illinois University Press. Illinois. Edited and completed by A.W. Burks (1966)Google Scholar
- [PP1]Popovici, A., Popovici, D.: Cellular automata and ö—uniform BSS-machines. Proc. Intern. Conf. on Symm and Antisymm. in Mathematics, Formal Languages and Computer Science. Bra§ov. June 29—July 1. (2000) 289–296Google Scholar
- PP2] Popovici, A., Popovici, D.: Codes and Classes of Cellular Automata. To appear.Google Scholar
- [TM]Toffoli, T., Margolus, N.: Cellular automata machines: A new environment for modelling. MIT Press. Cambridge. Massachusetts (1987)Google Scholar