Simulation limitations of affine cellular automata
From MaRDI portal
Publication:6549671
Recommendations
Cites work
- scientific article; zbMATH DE number 1714670 (Why is no real title available?)
- scientific article; zbMATH DE number 4195206 (Why is no real title available?)
- scientific article; zbMATH DE number 5117086 (Why is no real title available?)
- scientific article; zbMATH DE number 4070331 (Why is no real title available?)
- scientific article; zbMATH DE number 1222615 (Why is no real title available?)
- scientific article; zbMATH DE number 1136074 (Why is no real title available?)
- scientific article; zbMATH DE number 1962850 (Why is no real title available?)
- scientific article; zbMATH DE number 2086632 (Why is no real title available?)
- Algebraic properties of cellular automata
- Algebras in permutable varieties: Geometrical properties of affine algebras
- Bulking I: An abstract theory of bulking
- Bulking II: Classifications of cellular automata
- Communication complexity and intrinsic universality in cellular automata
- Exact results for deterministic cellular automata with additive rules
- Handbook of Natural Computing
- Intrinsic universality of a 1-dimensional reversible cellular automaton
- Linear cellular automata and recurring sequences in finite fields
- Linear cellular automata, finite automata and Pascal's triangle
- Machines, Computations, and Universality
- Mal'cev varieties
- On pseudovarieties
- Reversible space-time simulation of cellular automata
- Self-similarity of linear cellular automata
- Universality in elementary cellular automata
This page was built for publication: Simulation limitations of affine cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549671)