Abstract
The finite time probability measures of a one-dimensional cellular automaton are characterized using stochastic finite automata, which provides an analogy for probability measures to the theorem by Wolfram stating that the finite time sets are regular languages. The exact time evolution of the probability measure and the evolution of quantities measuring randomness and complexity are calculated in some examples. We also introduce a new approximation scheme for the time evolution of the probability measure.
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
S. Wolfram, “Computation Theory of Cellular Automata”, Comm. Math. Phys. 96 (1984) 15–57.
L. P. Hurd, “Formal Language Characterization of CA Limit Sets”, Complex Systems, 1 (1987) 69–80.
M. G. Nordahl, “Formal Languages and Finite CA”, Complex Systems, 3 (1989).
M. Denker, C. Grillenberger and K. Sigmund, Ergodic Theory on Compact Spaces, Springer Lecture Notes in Mathematics 527.
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading MA, 1979).
see e.g. proceedings from IEEE Structure in Complexity Theory.
M. P. Delest, “Generating Functions for Column-Convex Polyommoes”, Journal of Combinatorial Theory A48 (1988) 12–31.
S. Wolfram, “Statistical Mechanics of CA”, Rev. Mod. Phys., 55 (1983) 601–644.
H. Takahashi, “Undecidable Questions About the Maximal Invariant Set”, Information and Control, 33 (1977) 1–34.
S. Wolfram, “Universality and Complexity in CA”, Physica, 10D (1984) 1–35.
M. G. Nordahl, “Limit Sets and Attractors of Class Two CA”, Goteborg preprint.
K. Lindgren and M. G. Nordahl, “Complexity Measures and CA”, Complex Systems 2 (1988) 409–440.
B. Kitchens and S. Tuncel, “Finitary Measures for Subshifts of Finite Type and Sofie Systems”, Memoirs of the American Mathematical Society, 58 (1985) no. 338.
D. Zambella and P. Grassberger, “Complexity of Forecasting in a Class of Simple Models”, Complex Systems 2 (1988) 269–303.
R. Gallager, Information Theory and Reliable Communication, (John Wiley, NY, 1968).
B. Marcus, K. Petersen and S. Williams, “Transmission Rates and Factors of Markov Chains”, in Conference in Modern Analysis and Probability (AMS, Providence RI, 1984).
M. Nasu, preprint.
M. Li and P. Vitanyi, “Three Decades of Applied Kolmogorov Complexity”, in IEEE Structure in Complexity Theory 1988.
K. Lindgren, “Correlations and Random Information in CA”, Complex Systems, 1 (1987) 529–543.
S. Wolfram, “Origins of Randomness in Physical Systems”, Phys. Rev. Lett. 55 (1985) 449–452.
A. C. Yao, “Theory and Applications of Trapdoor Functions”, in Proc. 23rd IEEE Symposium on the Foundations of Computer Science, (1982) 80–91.
M. Blum and S. Micali, “How to Construct Cryptographically Strong Sequences of Pseudo Random Bits”, in 23rd FOCS, (1982) 112–117.
A. V. Goldberg and M. Sipser, “Compression and Ranking”, Proc. 17th ACM Symposium on Theory of Computing, (1985) 440–448.
P. Grassberger, “Towards a Quantitative Theory of Self-Generated Complexity”, Int. J. Theor. Phys., 25 (1986) 907–938.
B. A. Hubermann and T. Hogg, “Complexity and Adaptation”, Physica, 22D (1986) 376–384.
C. H. Bennett, “Dissipation, Information, Computational Complexity and the Definition of Organization”, in Emerging Syntheses in Science (Santa Fe Institute, 1985).
D. Angluin and C. H. Smith, “Inductive Inference: Theory and Methods”, ACM Computing Surveys, 15 (1983) 237–269.
M. G. Nordahl, in preparation.
H. A. Gutowitz, J. D. Victor and B. W. Knight, “Local Structure Theory for CA”, Physica, 28D (1987) 18–48.
H. A. Gutowitz and J. D. Victor, “LST in More than One Dimension”, Complex Systems, 1 (1987) 57–68.
H. A. Gutowitz, “Classification of CA According to Their Statistical Properties”, Los Alamos preprint.
M. G. Nordahl, to appear.
J. Rissanen, “Complexity of Strings in the Class of Markov Sources”, IEEE Transactions on Information Theory, IT-32 (1986) 526–532.
P. Cvitanovic, “Invariant Measurement of Strange Sets in Terms of Cycles”, Phys. Rev. Lett., 61 (1988) 2729–2732.
P. Grassberger, H. A. Gutowitz, M. G. Nordahl, work in progress.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nordahl, M.G. (1989). Cellular Automata Probability Measures. In: Manneville, P., Boccara, N., Vichniac, G.Y., Bidaux, R. (eds) Cellular Automata and Modeling of Complex Physical Systems. Springer Proceedings in Physics, vol 46. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75259-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-75259-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-75261-2
Online ISBN: 978-3-642-75259-9
eBook Packages: Springer Book Archive