Ergodicity, transitivity, and regularity for linear cellular automata over Zm
نویسندگان
چکیده
منابع مشابه
Ergodicity of Quantum Cellular Automata
We define a class of dynamical maps on the quasi-local algebra of a quantum spin system, which are quantum analogues of probabilistic cellular automata. We develop criteria for such a system to be ergodic, i.e., to possess a unique invariant state. Intuitively, ergodicity obtains if the local transition operators exhibit sufficiently large disorder. The ergodicity criteria also imply bounds for...
متن کاملLinear functional classes over cellular automata
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper, we investigate the ability of cellular automata related to functional computation. We introduce several functional classes of low time complexity which conta...
متن کاملPeriodicity and Transitivity for Cellular Automata in Besicovitch Topologies
We study cellular automata (CA) behavior in Besicovitch topology. We solve an open problem about the existence of transitive CA. The proof of this result has some interest in its own since it is obtained by using Kolmogorov complexity. At our knowledge it if the first result on discrete dynamical systems obtained using Kolmogorov complexity. We also prove that every CA (in Besicovitch topology)...
متن کاملOn the ergodic properties of certain additive cellular automata over Zm
In this paper, we investigate some ergodic properties of Z-actions Tp,n generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in Zm.
متن کاملTransitivity and Chaoticity in 1-D Cellular Automata
Recent progress in symbolic dynamics of cellular automata (CA) shows that many CA exhibit rich and complicated Bernoulli-shift properties, such as positive topological entropy, topological transitivity and even mixing. Noticeably, some CA are only transitive, but not mixing on their subsystems. Yet, for one-dimensional CA, this paper proves that not only the shift transitivity guarantees the CA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00005-x