scientific article; zbMATH DE number 1500511
From MaRDI portal
Publication:4501526
Recommendations
Cited in
(19)- Remarks on permutive cellular automata.
- Linear cellular automata with boundary conditions
- On the hierarchy of conservation laws in a cellular automaton
- Theory of cellular automata: a survey
- Dynamical behavior of additive cellular automata over finite abelian groups
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- An efficiently computable characterization of stability and instability for linear cellular automata
- Pre-expansivity in cellular automata
- Random matrix products and applications to cellular automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Universal groups of cellular automata
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption
- Easy to check algebraic characterizations of dynamical properties for linear CA and additive CA over a finite abelian group
- From linear to additive cellular automata
- A divide and conquer algorithm for deciding group cellular automata dynamics
- Toward non abelian scenarios for additive cellular automata on finite groups
- On subword decomposition and balanced polynomials
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501526)
