Algebraic properties of linear cellular automata

DOI10.1016/0024-3795(91)90116-EzbMath0790.68083OpenAlexW2084725469MaRDI QIDQ1177258

Lieven Le Bruyn, Michel Van den Bergh

Publication date: 26 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(91)90116-e

zbMATH Keywords

self-replicationcellular automatafinite-dimensional lattice

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Cellular automata (computational aspects) (68Q80)

Related Items (10)

Efficient exhaustive listings of reversible one dimensional cellular automata ⋮ Examples and quantum sections of schematic algebras ⋮ Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) ⋮ 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 ⋮ 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 ⋮ Dynamical behavior of additive cellular automata over finite abelian groups ⋮ Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties ⋮ Linear cellular automata with boundary conditions

Cites Work

• Computation and construction universality of reversible cellular automata
• Finitistic Dimension and a Homological Generalization of Semi-Primary Rings
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic properties of linear cellular automata