Abstract
We show how to compute the entropy of two important classes of cellular automata namely, linear and positively expansive cellular automata. In particular, we prove a closed formula for the topological entropy of D-dimensional (D ≥ 1) linear cellular automata over the ring Zm (m ≥ 2) and we provide an algorithm for computing the topological entropy of positively expansive cellular automata.
Cite
CITATION STYLE
D’amico, M., Manzini, G., & Margara, L. (1998). On computing the entropy of cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1443 LNCS, pp. 470–481). https://doi.org/10.1007/bfb0055076
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
