Dynamical behavior of additive cellular automata over finite abelian groups

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Ergodic theory on compact spaces
Sensitive dependence on initial conditions
Textile systems for endomorphisms and automorphisms of the shift
Endomorphisms and automorphisms of the shift dynamical system
Some properties of cellular automata with equicontinuity points
Languages, equicontinuity and attractors in cellular automata
On the directional dynamics of additive cellular automata
Solution of some conjectures about topological properties of linear cellular automata
From one-dimensional to two-dimensional cellular automata
A Full Cellular Automaton to Simulate Predator-Prey Systems
Non-uniform Cellular Automata
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Local rule distributions, language complexity and non-uniform cellular automata
The Nilpotency Problem of One-Dimensional Cellular Automata
Computing Issues of Asynchronous CA
Non-uniform cellular automata: classes, dynamics, and decidability
Conservation of some dynamical properties for operations on cellular automata
Dynamical properties of expansive one-sided cellular automata
Transitive Cellular Automata are Sensitive
Periodic points for onto cellular automata
Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
Lyapunov exponent versus expansivity and sensitivity in cellular automata
On computing the entropy of cellular automata.
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
Number-conserving cellular automata I: Decidability.
Rice's theorem for the limit sets of cellular automata
On the hierarchy of conservation laws in a cellular automaton
Three research directions in non-uniform cellular automata
Linear cellular automata over \(Z_ m\)
Ergodicity, transitivity, and regularity for linear cellular automata over \(\mathbb{Z}_m\)
Ergodic endomorphisms of compact Abelian groups
Mathematical Foundations of Computer Science 2004
Homogeneity of surjective cellular automata
Number conserving cellular automata. II: Dynamics.
Revisiting the Rice Theorem of Cellular Automata
Surjective linear cellular automata over \({\mathbb{Z}}_{m}\)
Algebraic properties of linear cellular automata
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
Decidability of sensitivity and equicontinuity for linear higher-order cellular automata
Pre-expansivity in cellular automata
Characterizing asymptotic randomization in abelian cellular automata

Cited In (7)

An efficiently computable characterization of stability and instability for linear cellular automata
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata
An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption
Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)

This page was built for publication: Dynamical behavior of additive cellular automata over finite abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003993)