no. 2 · Monday 26 October 2026
Random Cellular Automata and deBruijn Graphs
Abstract
Update rules of a one dimensional Cellular Automaton can be expressed using an edge-labeled deBruijn graph. We explore various questions about the image of a cellular automaton given by a randomly selected update rule by considering a random deBruijn graph.
- comments
- 80 pages, 8 figures
- fields
- Probability