Conservation Laws and Invariant Measures in Surjective Cellular Automata

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We discuss a close link between two seemingly different topics studied in the cellular automata literature: additive conservation laws and invariant probability measures. We provide an elementary proof of a simple correspondence between invariant full-support Bernoulli measures and interaction-free conserved quantities in the case of one-dimensional surjective cellular automata. We also discuss a generalization of this fact to Markov measures and higher-range conservation laws in arbitrary dimension. As a corollary, we show that the uniform Bernoulli measure is the only shift-invariant, full-support Markov measure that is invariant under a strongly transitive cellular automaton.

Cite

CITATION STYLE

APA

Kari, J., & Taati, S. (2012). Conservation Laws and Invariant Measures in Surjective Cellular Automata. In Discrete Mathematics and Theoretical Computer Science (Vol. AP, pp. 113–122). Discrete Mathematics and Theoretical Computer Science. https://doi.org/10.46298/dmtcs.2968

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free