A study on the composition of elementary cellular automata
From MaRDI portal
Cites work
- An Introduction to Symbolic Dynamics and Coding
- Cellular automata and groups
- Elementary, finite and linear vN-regular cellular automata
- Finding Groups in Data
- scientific article; zbMATH DE number 5814626 (Why is no real title available?)
- scientific article; zbMATH DE number 5380239 (Why is no real title available?)
- scientific article; zbMATH DE number 6255719 (Why is no real title available?)
- Idempotent cellular automata and their natural order
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- Representation theory of finite monoids
- Semigroups, rings, and Markov chains
- The Automorphism Group of a Shift of Finite Type
- Unified theory for finite Markov chains
- Universality in elementary cellular automata
This page was built for publication: A study on the composition of elementary cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890466)