Abstract
In a previous work we began to study the question of “how to compare” cellular automata (CA). In that context it was introduced a preorder (CA,≤) admitting a global minimum and it was shown that all the CA satisfying very simple dynamical properties as nilpotency or periodicity are located “on the bottom of (CA,≤)”. Here we prove that also the (algebraically amenable) additive CA over ℤ p are located on the bottom of (CA,≤). This result encourages our conjecture that says that the “distance” from the minimum could represent a measure of “complexity” on CA. We also prove that the additive CA over ℤ p with p prime are pairwise incomparable. This fact improves our understanding of (CA,≤) because it means that the minimum, even in the canonical order compatible with ≤, has infinite outdegree.
Preview
Unable to display preview. Download preview PDF.
References
J. Albert and K. čulik II. A simple universal cellular automaton and its one-way and totalistic version. Complex Systems, 1:1–16, 1987.
J.-P. Allouche, F. von Haeseler, H.-O. Peitgen, and G. Skordev. Linear cellular automata, finite automata and Pascal's triangle. Discrete Applied Mathematics, 66:1–22, 1996.
G. Birkhoff and S. MacLane. A survey of modern algebra, chapter VI. MacMillan, New York, 1953. (Theorem 15, Theorem 18).
F. Blanchard, A. Maass, and P. Kurka. Topological and measure-theoretic properties of one-dimensional cellular automata. Physica D, 103:86–99, 1997.
G. Braga, G. Cattaneo, P. Flocchini, and C. Quaranta Vogliotti. Pattern growth in elementary cellular automata. Theoretical Computer Science, 45:1–26, 1995.
K. čulik II and S. Yu. Undecidability of CA classification schemes. Complex Systems, 2:177–190, 1988.
A.R. Smith III. Simple computation-universal cellular spaces. Journal ACM, 18:339–353, 1971.
O. Martin, O. Odlyzko, and S. Wolfram. Algebraic properties of cellular automata. Communications in Mathematical Physics, 93:219–258, 1984.
J. Mazoyer and I. Rapaport. Inducing an order on cellular automata by a grouping operation. In STACS'98, volume 1373 of Lecture Notes in Computer Science, pages 116–127, 1998.
C. Moore. Predicting nonlinear cellular automata quickly by decomposing them into linear ones. Physica D, 111:27–41, 1998.
S. Wolfram. Universality and complexity in cellular automata. Physica D, 10:1–35, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mazoyer, J., Rapaport, I. (1998). Additive cellular automata over ℤp and the bottom of (CA,≤). In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055835
Download citation
DOI: https://doi.org/10.1007/BFb0055835
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive