Algebraic properties of linear cellular automata
From MaRDI portal
Recommendations
Cites work
Cited in
(30)- Algebraic properties of cellular automata
- Examples and quantum sections of schematic algebras
- Linear cellular automata with boundary conditions
- Line complexity asymptotics of polynomial cellular automata
- Efficient exhaustive listings of reversible one dimensional cellular automata
- 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
- Algebraic properties of some quadratic dynamical systems
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- On the structure of linear cellular automata
- Selfing dynamics in the rule space of additive cellular automata
- scientific article; zbMATH DE number 997720 (Why is no real title available?)
- scientific article; zbMATH DE number 4211532 (Why is no real title available?)
- Automorphisms of transition graphs for linear cellular automata
- scientific article; zbMATH DE number 98514 (Why is no real title available?)
- scientific article; zbMATH DE number 1142937 (Why is no real title available?)
- Linearization and Synthesis of Cellular Automata: The Additive Case
- REPLICATION PROPERTIES OF PARITY CELLULAR AUTOMATA
- Computational Analysis of One-Dimensional Cellular Automata
- scientific article; zbMATH DE number 7339761 (Why is no real title available?)
- Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
- Algebraic Properties of Cellular Automata: The Basis for Composition Technique
- Linear cellular automata and recurring sequences in finite fields
- 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
- On linear cellular automata
- From linear to additive cellular automata
- Toward non abelian scenarios for additive cellular automata on finite groups
This page was built for publication: Algebraic properties of linear cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177258)
