Abstract
A formal treatment of some of the properties of deterministic, rule 150, elementary one-dimensional cellular automata (CA) with null boundary conditions is presented. The general form of the characteristic polynomial of the CA global rule transition matrix is obtained. Mathematical relationships between the CA register lengths and the order of the corresponding group or semigroup structures are derived.
Similar content being viewed by others
References
D. Farmer, T. Toffoli, and S. Wolfram, eds. Proceedings of workshop on cellular automata, Los Alamos 1983,Physica D 10D (1984).
S. Wolfram,Theory and Applications of Cellular Automata (World Scientific, Singapore, 1986).
W. Pries, R. D. McLeod, A. Thanailakis, and H. C. Card, inProceedings Canadian VLSI Conference (1985), p. 205.
W. Pries, A. Thanailakis, and H. C. Card,IEEE Trans. Comp. C35:1013 (1986).
P. Tsalides, A. Thanailakis, H. C. Card, and W. Pries, inProceedings Comp Euro 87 VLSI and Computers Conference (1987), p. 160.
O. Martin, A. Odlyzko, and S. Wollfram,Commun. Math. Phys. 93:219 (1984).
Pu-hua Guan and Yu He,J. Stat. Phys. 43:463 (1986).
S. Wolfram,Rev. Mod. Phys. 55:601 (1983).
A. Thanailakis, W. Pries, C. J. Zarowski, and H. C. Card,J. Comput. Syst. Sci.
L. Mirsky,An Introduction to Linear Algebra (Dover, New York, 1982).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pitsianis, N., Tsalides, P., Bleris, G.L. et al. Deterministic one-dimensional cellular automata. J Stat Phys 56, 99–112 (1989). https://doi.org/10.1007/BF01044234
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01044234